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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Devlin, K.J.: Constructibility, Perspectives in Mathematical Logic. Springer, Berlin (1984)
Miyamoto, T.: A coding and a strongly inaccessible cardinal (a note, 2008)
Moore, J.: Set mapping reflection. J. Math. Log. 5(1), 87–97 (2005)
Todorcevic, S.: Generic absoluteness and the continuum. Math. Res. Lett. 9, 1–7 (2002)
Velleman, D.: Simplified morasses. J. Symb. Log. 49(1), 257–271 (1984)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Miyamoto, T. Codings and strongly inaccessible cardinals. Arch. Math. Logic 56, 1037–1044 (2017). https://doi.org/10.1007/s00153-017-0548-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-017-0548-5
Keywords
- Simplified morasses
- Strongly inaccessible cardinals
- Bounded Martin’s Maximum
- BPFA
- \(\theta _{AC}\)
- \(v_{AC}\)