- 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
Sacks forcing, Laver forcing, and Martin's axiom
Archive for Mathematical Logic 31 (3):145-161 (1992)
Abstract
In this paper we study the question assuming MA+⌝CH does Sacks forcing or Laver forcing collapse cardinals? We show that this question is equivalent to the question of what is the additivity of Marczewski's ideals 0. We give a proof that it is consistent that Sacks forcing collapses cardinals. On the other hand we show that Laver forcing does not collapse cardinalsOther 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
Higher Miller forcing may collapse cardinals.Heike Mildenberger & Saharon Shelah - 2021 - Journal of Symbolic Logic 86 (4):1721-1744.
More forcing notions imply diamond.Andrzej Rosłanowski & Saharon Shelah - 1996 - Archive for Mathematical Logic 35 (5-6):299-313.
Projective absoluteness for Sacks forcing.Daisuke Ikegami - 2009 - Archive for Mathematical Logic 48 (7):679-690.
Arithmetical Sacks Forcing.Rod Downey & Liang Yu - 2006 - Archive for Mathematical Logic 45 (6):715-720.
The lottery preparation.Joel David Hamkins - 2000 - Annals of Pure and Applied Logic 101 (2-3):103-146.
Indestructible Weakly Compact Cardinals and the Necessity of Supercompactness for Certain Proof Schemata.J. D. Hamkins & A. W. Apter - 2001 - Mathematical Logic Quarterly 47 (4):563-572.
More on cichoń's diagram and infinite games.Masaru Kada - 2000 - Journal of Symbolic Logic 65 (4):1713-1724.
Removing Laver functions from supercompactness arguments.Arthur W. Apter - 2005 - Mathematical Logic Quarterly 51 (2):154.
Combinatorial properties of classical forcing notions.Jörg Brendle - 1995 - Annals of Pure and Applied Logic 73 (2):143-170.
Analytics
Added to PP
2013-11-23
Downloads
60 (#286,477)
6 months
16 (#282,112)
2013-11-23
Downloads
60 (#286,477)
6 months
16 (#282,112)
Historical graph of downloads
Citations of this work
Antichains of perfect and splitting trees.Paul Hein & Otmar Spinas - 2020 - Archive for Mathematical Logic 59 (3-4):367-388.
Silver Antichains.Otmar Spinas & Marek Wyszkowski - 2015 - Journal of Symbolic Logic 80 (2):503-519.
Strongly dominating sets of reals.Michal Dečo & Miroslav Repický - 2013 - Archive for Mathematical Logic 52 (7-8):827-846.
No Tukey reduction of Lebesgue null to Silver null sets.Otmar Spinas - 2018 - Journal of Mathematical Logic 18 (2):1850011.
References found in this work
Iterated perfect-set forcing.James E. Baumgartner & Richard Laver - 1979 - Annals of Mathematical Logic 17 (3):271-288.
On the Consistency of Some Partition Theorems for Continuous Colorings, and the Structure of ℵ 1 -Dense Real Order Types.J. Steprans, Uri Abraham, Matatyahu Rubin & Saharon Shelah - 2002 - Bulletin of Symbolic Logic 8 (2):303.
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-9b866bbb8-nm99f uwo