- 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
Changing cardinal characteristics without changing ω-sequences or cofinalities
Annals of Pure and Applied Logic 106 (1-3):207-261 (2000)
Abstract
We show: There are pairs of universes V1V2 and there is a notion of forcing PV1 such that the change mentioned in the title occurs when going from V1[G] to V2[G] for a P-generic filter G over V2. We use forcing iterations with partial memories. Moreover, we implement highly transitive automorphism groups into the forcing ordersOther Versions
No versions found
My notes
Similar books and articles
The Strengths of Some Violations of Covering.Heike Mildenberger - 2001 - Mathematical Logic Quarterly 47 (3):291-298.
Changing the heights of automorphism towers.Joel David Hamkins & Simon Thomas - 2000 - Annals of Pure and Applied Logic 102 (1-2):139-157.
On Restrictions of Ultrafilters From Generic Extensions to Ground Models.Moti Gitik & Eyal Kaplan - 2023 - Journal of Symbolic Logic 88 (1):169-190.
Forcing indestructibility of MAD families.Jörg Brendle & Shunsuke Yatabe - 2005 - Annals of Pure and Applied Logic 132 (2):271-312.
Generics for computable Mathias forcing.Peter A. Cholak, Damir D. Dzhafarov, Jeffry L. Hirst & Theodore A. Slaman - 2014 - Annals of Pure and Applied Logic 165 (9):1418-1428.
Restrictions on forcings that change cofinalities.Yair Hayut & Asaf Karagila - 2016 - Archive for Mathematical Logic 55 (3-4):373-384.
Changing the Heights of Automorphism Towers by Forcing with Souslin Trees over L.Gunter Fuchs & Joel David Hamkins - 2008 - Journal of Symbolic Logic 73 (2):614 - 633.
Can a small forcing create Kurepa trees.Renling Jin & Saharon Shelah - 1997 - Annals of Pure and Applied Logic 85 (1):47-68.
Combinatorics and forcing with distributive ideals.Pierre Matet - 1997 - Annals of Pure and Applied Logic 86 (2):137-201.
Laver Indestructibility and the Class of Compact Cardinals.Arthur W. Apter - 1998 - Journal of Symbolic Logic 63 (1):149-157.
Analytics
Added to PP
2014-01-16
Downloads
40 (#561,410)
6 months
10 (#407,001)
2014-01-16
Downloads
40 (#561,410)
6 months
10 (#407,001)
Historical graph of downloads
Citations of this work
Abraham–Rubin–Shelah open colorings and a large continuum.Thomas Gilton & Itay Neeman - 2022 - Journal of Mathematical Logic 22 (1).
The cofinality of the saturated uncountable random graph.Steve Warner - 2004 - Archive for Mathematical Logic 43 (5):665-679.
References found in this work
The negation of the singular cardinal hypothesis from o(K)=K++.Moti Gitik - 1989 - Annals of Pure and Applied Logic 43 (3):209-234.
Indiscernible sequences for extenders, and the singular cardinal hypothesis.Moti Gitik & William J. Mitchell - 1996 - Annals of Pure and Applied Logic 82 (3):273-316.
Changing cardinal invariants of the reals without changing cardinals or the reals.Heike Mildenberger - 1998 - Journal of Symbolic Logic 63 (2):593-599.
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-vpvvv uwo