The iterability hierarchy above I3 [Book Review]

Archive for Mathematical Logic 58 (1-2):77-97 (2019)
  Copy   BIBTEX

Abstract

In this paper we introduce a new hierarchy of large cardinals between I3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathrm{\mathsf {I3}}}}$$\end{document} and I2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathrm{\mathsf {I2}}}}$$\end{document}, the iterability hierarchy, and we prove that every step of it strongly implies the ones below.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,571

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

Bounded Martin’s Maximum with an Asterisk.David Asperó & Ralf Schindler - 2014 - Notre Dame Journal of Formal Logic 55 (3):333-348.
Non-Fregean Propositional Logic with Quantifiers.Joanna Golińska-Pilarek & Taneli Huuskonen - 2016 - Notre Dame Journal of Formal Logic 57 (2):249-279.
Determinacy in strong cardinal models.P. D. Welch - 2011 - Journal of Symbolic Logic 76 (2):719 - 728.
On the jump classes of noncuppable enumeration degrees.Charles M. Harris - 2011 - Journal of Symbolic Logic 76 (1):177 - 197.
A Nonstandard Counterpart of WWKL.Stephen G. Simpson & Keita Yokoyama - 2011 - Notre Dame Journal of Formal Logic 52 (3):229-243.
On Interpretability in the Theory of Concatenation.Vítězslav Švejdar - 2009 - Notre Dame Journal of Formal Logic 50 (1):87-95.
A note on da Costa-Doria “exotic formalizations”.L. Gordeev - 2010 - Archive for Mathematical Logic 49 (7-8):813-821.
Canjar Filters.Osvaldo Guzmán, Michael Hrušák & Arturo Martínez-Celis - 2017 - Notre Dame Journal of Formal Logic 58 (1):79-95.
The veblen functions for computability theorists.Alberto Marcone & Antonio Montalbán - 2011 - Journal of Symbolic Logic 76 (2):575 - 602.
A hierarchy of tree-automatic structures.Olivier Finkel & Stevo Todorčević - 2012 - Journal of Symbolic Logic 77 (1):350-368.
Around splitting and reaping for partitions of ω.Hiroaki Minami - 2010 - Archive for Mathematical Logic 49 (4):501-518.
Growing Commas. A Study of Sequentiality and Concatenation.Albert Visser - 2009 - Notre Dame Journal of Formal Logic 50 (1):61-85.

Analytics

Added to PP
2018-04-19

Downloads
10 (#1,186,283)

6 months
3 (#967,057)

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

Suitable extender models II: Beyond ω-huge.W. Hugh Woodin - 2011 - Journal of Mathematical Logic 11 (2):115-436.
Implications between strong large cardinal axioms.Richard Laver - 1997 - Annals of Pure and Applied Logic 90 (1-3):79-90.
A partially non-proper ordinal beyond L.Vincenzo Dimonte - 2012 - Annals of Pure and Applied Logic 163 (9):1309-1321.
No Elementary Embedding from V into V is Definable from Parameters.Akira Suzuki - 1999 - Journal of Symbolic Logic 64 (4):1591-1594.

Add more references