Codings and strongly inaccessible cardinals

Archive for Mathematical Logic 56 (7-8):1037-1044 (2017)
  Copy   BIBTEX

Abstract

We show that a coding principle introduced by J. Moore with respect to all ladder systems is equiconsistent with the existence of a strongly inaccessible cardinal. We also show that a coding principle introduced by S. Todorcevic has consistency strength at least of a strongly inaccessible cardinal.

Categories

Add categories

Keywords

Reprint years

DOI

10.1007/s00153-017-0548-5

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

Inaccessible Cardinals, Failures of GCH, and Level-by-Level Equivalence.Arthur W. Apter - 2014 - Notre Dame Journal of Formal Logic 55 (4):431-444.
Patterns of compact cardinals.Arthur W. Apter - 1997 - Annals of Pure and Applied Logic 89 (2-3):101-115.
Strong Compactness and a Global Version of a Theorem of Ben-David and Magidor.Arthur W. Apter - 2000 - Mathematical Logic Quarterly 46 (4):453-460.
Proper forcing extensions and Solovay models.Joan Bagaria & Roger Bosch - 2004 - Archive for Mathematical Logic 43 (6):739-750.
Partition Complete Boolean Algebras and Almost Compact Cardinals.Peter Jipsen & Henry Rose - 1999 - Mathematical Logic Quarterly 45 (2):241-255.
Identity crises and strong compactness III: Woodin cardinals. [REVIEW]Arthur W. Apter & Grigor Sargsyan - 2006 - Archive for Mathematical Logic 45 (3):307-322.
Indestructibility, HOD, and the Ground Axiom.Arthur W. Apter - 2011 - Mathematical Logic Quarterly 57 (3):261-265.
On the indestructibility aspects of identity crisis.Grigor Sargsyan - 2009 - Archive for Mathematical Logic 48 (6):493-513.
Characterizing strong compactness via strongness.Arthur W. Apter - 2003 - Mathematical Logic Quarterly 49 (4):375.
Inaccessible set axioms may have little consistency strength.L. Crosilla & M. Rathjen - 2002 - Annals of Pure and Applied Logic 115 (1-3):33-70.
Universal indestructibility for degrees of supercompactness and strongly compact cardinals.Arthur W. Apter & Grigor Sargsyan - 2008 - Archive for Mathematical Logic 47 (2):133-142.
Borel's conjecture in topological groups.Fred Galvin & Marion Scheepers - 2013 - Journal of Symbolic Logic 78 (1):168-184.
Exactly controlling the non-supercompact strongly compact cardinals.Arthur W. Apter & Joel David Hamkins - 2003 - Journal of Symbolic Logic 68 (2):669-688.
Elementary chains and C (n)-cardinals.Konstantinos Tsaprounis - 2014 - Archive for Mathematical Logic 53 (1-2):89-118.
Tall cardinals.Joel D. Hamkins - 2009 - Mathematical Logic Quarterly 55 (1):68-86.

Analytics

Added to PP
2017-09-20

Downloads
11 (#1,110,001)

6 months
1 (#1,510,037)

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

Set mapping reflection.Justin Tatch Moore - 2005 - Journal of Mathematical Logic 5 (1):87-97.
Simplified morasses.Dan Velleman - 1984 - Journal of Symbolic Logic 49 (1):257-271.

Add more references