Studia Logica 84 (3):425 - 449 (2006)

B. R. George
Carnegie Mellon University
The notions of finite and infinite second-order characterizability of cardinal and ordinal numbers are developed. Several known results for the case of finite characterizability are extended to infinite characterizability, and investigations of the second-order theory of ordinals lead to some observations about the Fraenkel-Carnap question for well-orders and about the relationship between ordinal characterizability and ordinal arithmetic. The broader significance of cardinal characterizability and the relationships between different notions of characterizability are also discussed.
Keywords Philosophy   Computational Linguistics   Mathematical Logic and Foundations   Logic
Categories (categorize this paper)
Reprint years 2007
DOI 10.1007/s11225-006-9016-7
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 54,431
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Basic Set Theory.H. T. Hodes - 1981 - Philosophical Review 90 (2):298-300.
Basic Set Theory.William Mitchell - 1981 - Journal of Symbolic Logic 46 (2):417-419.
The Fraenkel‐Carnap Question for Dedekind Algebras.George Weaver & Benjamin George - 2003 - Mathematical Logic Quarterly 49 (1):92-96.

View all 10 references / Add more references

Citations of this work BETA

Fraenkel–Carnap Questions for Equivalence Relations.George Weaver & Irena Penev - 2011 - Australasian Journal of Logic 10:52-66.

Add more citations

Similar books and articles

The Largest Countable Inductive Set is a Mouse Set.Mitch Rudominer - 1999 - Journal of Symbolic Logic 64 (2):443-459.
Order Types of Ordinals in Models of Set Theory.John E. Hutchinson - 1976 - Journal of Symbolic Logic 41 (2):489-502.
Turing Computations on Ordinals.Peter Koepke - 2005 - Bulletin of Symbolic Logic 11 (3):377-397.
Proper Forcing and L(ℝ).Itay Neeman & Jindřich Zapletal - 2001 - Journal of Symbolic Logic 66 (2):801-810.
Nonexistence of Universal Orders in Many Cardinals.Menachem Kojman & Saharon Shelah - 1992 - Journal of Symbolic Logic 57 (3):875-891.
Stretchings.O. Finkel & J. P. Ressayre - 1996 - Journal of Symbolic Logic 61 (2):563-585.


Added to PP index

Total views
33 ( #303,786 of 2,371,804 )

Recent downloads (6 months)
6 ( #129,314 of 2,371,804 )

How can I increase my downloads?


My notes