Second-order characterizable cardinals and ordinals

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

Abstract

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,261

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

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.

Analytics

Added to PP
2009-01-28

Downloads
46 (#347,610)

6 months
9 (#317,143)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

B. R. George
University of California, Los Angeles (PhD)

Citations of this work

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

Add more citations