Cardinality without Enumeration

Studia Logica 80 (1):121-141 (2005)
  Copy   BIBTEX

Abstract

We show that the notion of cardinality of a set is independent from that of wellordering, and that reasonable total notions of cardinality exist in every model of ZF where the axiom of choice fails. Such notions are either definable in a simple and natural way, or non-definable, produced by forcing. Analogous cardinality notions exist in nonstandard models of arithmetic admitting nontrivial automorphisms. Certain motivating phenomena from quantum mechanics are also discussed in the Appendix.

Categories

Keywords

Reprint years

DOI

10.1007/s11225-005-6780-8

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

A jump inversion theorem for the enumeration jump.I. N. Soskov - 2000 - Archive for Mathematical Logic 39 (6):417-437.
The jump operator on the ω-enumeration degrees.Hristo Ganchev & Ivan N. Soskov - 2009 - Annals of Pure and Applied Logic 160 (3):289-301.
Noncappable enumeration degrees below 0'e. [REVIEW]S. Barry Cooper & Andrea Sorbi - 1996 - Journal of Symbolic Logic 61 (4):1347 - 1363.
The limitations of cupping in the local structure of the enumeration degrees.Mariya I. Soskova - 2010 - Archive for Mathematical Logic 49 (2):169-193.
Branching in the $${\Sigma^0_2}$$ -enumeration degrees: a new perspective. [REVIEW]Maria L. Affatato, Thomas F. Kent & Andrea Sorbi - 2008 - Archive for Mathematical Logic 47 (3):221-231.
Cupping and noncupping in the enumeration degrees of ∑20 sets.S. Barry Cooper, Andrea Sorbi & Xiaoding Yi - 1996 - Annals of Pure and Applied Logic 82 (3):317-342.
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds.Kate Copestake - 1997 - Mathematical Logic Quarterly 43 (3):287-310.
A non-splitting theorem in the enumeration degrees.Mariya Ivanova Soskova - 2009 - Annals of Pure and Applied Logic 160 (3):400-418.
Bounding Nonsplitting Enumeration Degrees.Thomas F. Kent & Andrea Sorbi - 2007 - Journal of Symbolic Logic 72 (4):1405 - 1417.
Sets of generators and automorphism bases for the enumeration degrees.Andrea Sorbi - 1998 - Annals of Pure and Applied Logic 94 (1-3):263-272.
Uniform enumeration operations.A. H. Lachlan - 1975 - Journal of Symbolic Logic 40 (3):401-409.
Three theorems on recursive enumeration. I. decomposition. II. maximal set. III. enumeration without duplication.Richard M. Friedberg - 1958 - Journal of Symbolic Logic 23 (3):309-316.
On the Symmetric Enumeration Degrees.Charles M. Harris - 2007 - Notre Dame Journal of Formal Logic 48 (2):175-204.
Bounded enumeration reducibility and its degree structure.Daniele Marsibilio & Andrea Sorbi - 2012 - Archive for Mathematical Logic 51 (1-2):163-186.
Cardinality Arguments Against Regular Probability Measures.Thomas Hofweber - 2014 - Thought: A Journal of Philosophy 3 (2):166-175.

Analytics

Added to PP
2009-01-28

Downloads
40 (#388,897)

6 months
7 (#411,886)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No two entities without identity.Benjamin C. Jantzen - 2011 - Synthese 181 (3):433-450.
Many entities, no identity.Jonas R. Becker Arenhart - 2012 - Synthese 187 (2):801-812.

Add more citations

References found in this work

[Omnibus Review].Thomas Jech - 1992 - Journal of Symbolic Logic 57 (1):261-262.
Constructive set theory.John Myhill - 1975 - Journal of Symbolic Logic 40 (3):347-382.
On a quasi-set theory.Décio Krause - 1992 - Notre Dame Journal of Formal Logic 33 (3):402--11.
Quantum mechanics and haecceities.Paul Teller - 1998 - In Elena Castellani (ed.), Interpreting Bodies. Princeton University Press. pp. 114--141.

View all 10 references / Add more references