Cantor’s Theorem May Fail for Finitary Partitions

Journal of Symbolic Logic:1-18 (forthcoming)
  Copy   BIBTEX

Abstract

A partition is finitary if all its members are finite. For a set A, $\mathscr {B}(A)$ denotes the set of all finitary partitions of A. It is shown consistent with $\mathsf {ZF}$ (without the axiom of choice) that there exist an infinite set A and a surjection from A onto $\mathscr {B}(A)$. On the other hand, we prove in $\mathsf {ZF}$ some theorems concerning $\mathscr {B}(A)$ for infinite sets A, among which are the following: (1) If there is a finitary partition of A without singleton blocks, then there are no surjections from A onto $\mathscr {B}(A)$ and no finite-to-one functions from $\mathscr {B}(A)$ to A. (2) For all $n\in \omega $, $|A^n|<|\mathscr {B}(A)|$. (3) $|\mathscr {B}(A)|\neq |\mathrm {seq}(A)|$, where $\mathrm {seq}(A)$ is the set of all finite sequences of elements of A.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 97,335

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A Generalized Cantor Theorem In.Yinhe Peng & Guozhen Shen - 2024 - Journal of Symbolic Logic 89 (1):204-210.
Consequences of arithmetic for set theory.Lorenz Halbeisen & Saharon Shelah - 1994 - Journal of Symbolic Logic 59 (1):30-40.
A Note on Strongly Almost Disjoint Families.Guozhen Shen - 2020 - Notre Dame Journal of Formal Logic 61 (2):227-231.

Analytics

Added to PP
2024-04-05

Downloads
19 (#928,307)

6 months
7 (#926,546)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations