Odd-sized partitions of Russell-sets

Mathematical Logic Quarterly 56 (2):185-190 (2010)
  Copy   BIBTEX

Abstract

In the setting of ZF, i.e., Zermelo–Fraenkel set theory without the Axiom of Choice , we study partitions of Russell-sets into sets each with exactly n elements , for some integer n. We show that if n is odd, then a Russell-set X has an n -ary partition if and only if |X | is divisible by n. Furthermore, we establish that it is relative consistent with ZF that there exists a Russell-set X such that |X | is not divisible by any finite cardinal n > 1

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,963

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

Powers of 2.Kyriakos Keremedis & Horst Herrlich - 1999 - Notre Dame Journal of Formal Logic 40 (3):346-351.
A dedekind finite borel set.Arnold W. Miller - 2011 - Archive for Mathematical Logic 50 (1-2):1-17.
The First-Order Structure of Weakly Dedekind-Finite Sets.A. C. Walczak-Typke - 2005 - Journal of Symbolic Logic 70 (4):1161 - 1170.
Sets and Point-Sets: Five Grades of Set-Theoretic Involvement in Geometry.John P. Burgess - 1988 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1988:456 - 463.
The ordertype of β-r.E. Sets.Klaus Sutner - 1990 - Journal of Symbolic Logic 55 (2):573-576.
The spectrum of partitions of a Boolean algebra.J. Donald Monk - 2001 - Archive for Mathematical Logic 40 (4):243-254.
Erdös-Rado without Choice.Thomas Forster - 2007 - Journal of Symbolic Logic 72 (3):897 - 900.

Analytics

Added to PP
2013-12-01

Downloads
10 (#1,194,738)

6 months
1 (#1,472,961)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references