- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
A criterion for coarse iterability
Archive for Mathematical Logic 49 (4):447-467 (2010)
Abstract
The main result of this paper is the following theorem: Let M be a premouse with a top extender, F. Suppose that (a) M is linearly coarsely iterable via hitting F and its images, and (b) if M * is a linear iterate of M as in (a), then M * is coarsely iterable with respect to iteration trees which do not use the top extender of M * and its images. Then M is coarsely iterableAuthor's Profile
Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Iterability for (transfinite) stacks.Farmer Schlutzenberg - 2021 - Journal of Mathematical Logic 21 (2):2150008.
The self-iterability of L[E].Ralf Schindler & John Steel - 2009 - Journal of Symbolic Logic 74 (3):751-779.
A Long Pseudo-Comparison of Premice in L[x].Farmer Schlutzenberg - 2018 - Notre Dame Journal of Formal Logic 59 (4):599-604.
The Definability of the Extender Sequence From In.Farmer Schlutzenberg - 2024 - Journal of Symbolic Logic 89 (2):427-459.
λ-structures and s-structures: Translating the iteration strategies.Gunter Fuchs - 2011 - Annals of Pure and Applied Logic 162 (9):710-751.
Comparison of fine structural mice via coarse iteration.F. Schlutzenberg & J. R. Steel - 2014 - Archive for Mathematical Logic 53 (5-6):539-559.
A Universal Extender Model Without Large Cardinals In V.William Mitchell & Ralf Schindler - 2004 - Journal of Symbolic Logic 69 (2):371-386.
Indiscernible sequences in a model which fails to have the order property.Rami Grossberg - 1991 - Journal of Symbolic Logic 56 (1):115-123.
The classification of small weakly minimal sets. III: Modules.Steven Buechler - 1988 - Journal of Symbolic Logic 53 (3):975-979.
Analytics
Added to PP
2013-11-23
Downloads
75 (#279,065)
6 months
7 (#702,633)
2013-11-23
Downloads
75 (#279,065)
6 months
7 (#702,633)
Historical graph of downloads
Author's Profile
Citations of this work
Mice with finitely many Woodin cardinals from optimal determinacy hypotheses.Sandra Müller, Ralf Schindler & W. Hugh Woodin - 2020 - Journal of Mathematical Logic 20 (Supp01):1950013.
Woodin's axiom , bounded forcing axioms, and precipitous ideals on ω 1.Benjamin Claverie & Ralf Schindler - 2012 - Journal of Symbolic Logic 77 (2):475-498.
Stacking mice.Ronald Jensen, Ernest Schimmerling, Ralf Schindler & John Steel - 2009 - Journal of Symbolic Logic 74 (1):315-335.
The consistency strength of long projective determinacy.Juan P. Aguilera & Sandra Müller - 2019 - Journal of Symbolic Logic 85 (1):338-366.
Preserving levels of projective determinacy by tree forcings.Fabiana Castiblanco & Philipp Schlicht - 2021 - Annals of Pure and Applied Logic 172 (4):102918.
References found in this work
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-559df78dcc-45kst uwo