- 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
Many countable support iterations of proper forcings preserve Souslin trees
Annals of Pure and Applied Logic 165 (2):573-608 (2014)
Abstract
We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation properties in countable support iterations in the so-called Case A that does not need a division into forcings that add reals and those who do notOther Versions
No versions found
My notes
Similar books and articles
New reals: Can live with them, can live without them.Martin Goldstern & Jakob Kellner - 2006 - Mathematical Logic Quarterly 52 (2):115-124.
Preserving Preservation.Jakob Kellner & Saharon Shelah - 2005 - Journal of Symbolic Logic 70 (3):914 - 945.
Specialising Aronszajn trees by countable approximations.Heike Mildenberger & Saharon Shelah - 2003 - Archive for Mathematical Logic 42 (7):627-647.
Cardinal characteristics and projective wellorders.Vera Fischer & Sy David Friedman - 2010 - Annals of Pure and Applied Logic 161 (7):916-922.
Non-stationary support iterations of Prikry forcings and restrictions of ultrapower embeddings to the ground model.Moti Gitik & Eyal Kaplan - 2023 - Annals of Pure and Applied Logic 174 (1):103164.
Applications of the ergodic iteration theorem.Jindřich Zapletal - 2010 - Mathematical Logic Quarterly 56 (2):116-125.
Understanding preservation theorems, II.Chaz Schlindwein - 2010 - Mathematical Logic Quarterly 56 (5):549-560.
On coherent families of finite-to-one functions.Piotr Koszmider - 1993 - Journal of Symbolic Logic 58 (1):128-138.
The club principle and the distributivity number.Heike Mildenberger - 2011 - Journal of Symbolic Logic 76 (1):34 - 46.
Analytics
Added to PP
2014-01-16
Downloads
22 (#963,101)
6 months
7 (#681,649)
2014-01-16
Downloads
22 (#963,101)
6 months
7 (#681,649)
Historical graph of downloads
References found in this work
There may be simple Pℵ1 and Pℵ2-points and the Rudin-Keisler ordering may be downward directed.Andreas Blass & Saharon Shelah - 1987 - Annals of Pure and Applied Logic 33 (C):213-243.
Near coherence of filters. III. A simplified consistency proof.Andreas Blass & Saharon Shelah - 1989 - Notre Dame Journal of Formal Logic 30 (4):530-538.
Reasonable Ultrafilters, Again.Andrzej Rosłanowski & Saharon Shelah - 2011 - Notre Dame Journal of Formal Logic 52 (2):113-147.
New reals: Can live with them, can live without them.Martin Goldstern & Jakob Kellner - 2006 - Mathematical Logic Quarterly 52 (2):115-124.
Cardinal invariants of the continuum and combinatorics on uncountable cardinals.Jörg Brendle - 2006 - Annals of Pure and Applied Logic 144 (1-3):43-72.
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-f8568656d-2jqln uwo