Generalizations of Cantor's theorem in ZF

Mathematical Logic Quarterly 63 (5):428-436 (2017)
  Copy   BIBTEX

Abstract

A set x is Dedekind infinite if there is an injection from ω into x; otherwise x is Dedekind finite. A set x is power Dedekind infinite if math formula, the power set of x, is Dedekind infinite; otherwise x is power Dedekind finite. For a set x, let pdfin be the set of all power Dedekind finite subsets of x. In this paper, we prove in math formula two generalizations of Cantor's theorem : The first one is that for all power Dedekind infinite sets x, there are no Dedekind finite to one maps from math formula into pdfin. The second one is that for all sets math formula, if x is infinite and there is a power Dedekind finite to one map from y into x, then there are no surjections from y onto math formula. We also obtain some related results.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 99,533

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 Note on Weakly Dedekind Finite Sets.Pimpen Vejjajiva & Supakun Panasawatwong - 2014 - Notre Dame Journal of Formal Logic 55 (3):413-417.
Non‐discrete metrics in and some notions of finiteness.Kyriakos Keremedis - 2016 - Mathematical Logic Quarterly 62 (4-5):383-390.
No decreasing sequence of cardinals.Paul Howard & Eleftherios Tachtsis - 2016 - Archive for Mathematical Logic 55 (3-4):415-429.
Finiteness Classes and Small Violations of Choice.Horst Herrlich, Paul Howard & Eleftherios Tachtsis - 2016 - Notre Dame Journal of Formal Logic 57 (3):375-388.
Definability of types, and pairs of o-minimal structures.Anand Pillay - 1994 - Journal of Symbolic Logic 59 (4):1400-1409.
Divisibility of dedekind finite sets.David Blair, Andreas Blass & Paul Howard - 2005 - Journal of Mathematical Logic 5 (1):49-85.
The First-Order Structure of Weakly Dedekind-Finite Sets.A. C. Walczak-Typke - 2005 - Journal of Symbolic Logic 70 (4):1161 - 1170.

Analytics

Added to PP
2018-01-11

Downloads
25 (#753,390)

6 months
3 (#1,427,050)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A Generalized Cantor Theorem In.Yinhe Peng & Guozhen Shen - 2024 - Journal of Symbolic Logic 89 (1):204-210.
A Note on Strongly Almost Disjoint Families.Guozhen Shen - 2020 - Notre Dame Journal of Formal Logic 61 (2):227-231.
Cantor’s Theorem May Fail for Finitary Partitions.Guozhen Shen - forthcoming - Journal of Symbolic Logic:1-18.

View all 6 citations / Add more citations

References found in this work

Basic Set Theory.William Mitchell - 1981 - Journal of Symbolic Logic 46 (2):417-419.
Consequences of arithmetic for set theory.Lorenz Halbeisen & Saharon Shelah - 1994 - Journal of Symbolic Logic 59 (1):30-40.
The well‐ordered and well‐orderable subsets of a set.John Truss - 1973 - Mathematical Logic Quarterly 19 (14‐18):211-214.
Finite-to-one maps.Thomas Forster - 2003 - Journal of Symbolic Logic 68 (4):1251-1253.

View all 6 references / Add more references