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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,779

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

Proper forcing extensions and Solovay models.Joan Bagaria & Roger Bosch - 2004 - Archive for Mathematical Logic 43 (6):739-750.
Strong Compactness, Square, Gch, and Woodin Cardinals.Arthur W. Apter - forthcoming - Journal of Symbolic Logic:1-9.
Inaccessible Cardinals, Failures of GCH, and Level-by-Level Equivalence.Arthur W. Apter - 2014 - Notre Dame Journal of Formal Logic 55 (4):431-444.
Some remarks on indestructibility and Hamkins? lottery preparation.Arthur W. Apter - 2003 - Archive for Mathematical Logic 42 (8):717-735.
Strongly unfoldable, splitting and bounding.Ömer Faruk Bağ & Vera Fischer - 2023 - Mathematical Logic Quarterly 69 (1):7-14.
Partition Relations for Strongly Normal Ideals on Pκ(λ).Pierre Matet - 2000 - Mathematical Logic Quarterly 46 (1):87-103.
Patterns of compact cardinals.Arthur W. Apter - 1997 - Annals of Pure and Applied Logic 89 (2-3):101-115.

Analytics

Added to PP
2017-09-20

Downloads
11 (#1,145,893)

6 months
1 (#1,720,529)

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