Forcing Indestructibility of Set-Theoretic Axioms

Journal of Symbolic Logic 72 (1):349 - 360 (2007)
  Copy   BIBTEX

Abstract

Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the Lévy collapse. These show in particular that certain applications of forcing axioms require to add generic countable sequences high up in the set-theoretic hierarchy even before collapsing everything down to ‮א‬₁. Later we give applications, among them the consistency of MM with ‮א‬ω not being Jónsson which answers a question raised in the set theory meeting at Oberwolfach in 2005

Links

PhilArchive



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

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

Small forcing makes any cardinal superdestructible.Joel David Hamkins - 1998 - Journal of Symbolic Logic 63 (1):51-58.
A maximal bounded forcing axiom.David Asperó - 2002 - Journal of Symbolic Logic 67 (1):130-142.
Projective Well-Orderings and Bounded Forcing Axioms.Andrés Eduardo Caicedo - 2005 - Journal of Symbolic Logic 70 (2):557 - 572.
The Axioms of Set Theory.Jairo José Da Silva - 2002 - Axiomathes 13 (2):107-126.
The independence of δ1n.Amir Leshem & Menachem Magidor - 1999 - Journal of Symbolic Logic 64 (1):350 - 362.
E pluribus unum: Plural logic and set theory.John P. Burgess - 2004 - Philosophia Mathematica 12 (3):193-221.
Simple forcing notions and forcing axioms.Andrzej Rosłanowski & Saharon Shelah - 1997 - Journal of Symbolic Logic 62 (4):1297-1314.
An Order-Theoretic Account of Some Set-Theoretic Paradoxes.Thomas Forster & Thierry Libert - 2011 - Notre Dame Journal of Formal Logic 52 (1):1-19.
Axioms for the set-theoretic hierarchy.James van Aken - 1986 - Journal of Symbolic Logic 51 (4):992-1004.

Analytics

Added to PP
2010-08-24

Downloads
17 (#819,600)

6 months
5 (#544,079)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The combinatorial essence of supercompactness.Christoph Weiß - 2012 - Annals of Pure and Applied Logic 163 (11):1710-1717.
Guessing models and the approachability ideal.Rahman Mohammadpour & Boban Veličković - 2020 - Journal of Mathematical Logic 21 (2):2150003.

Add more citations

References found in this work

[Omnibus Review].Akihiro Kanamori - 1981 - Journal of Symbolic Logic 46 (4):864-866.
Saturated ideals.Kenneth Kunen - 1978 - Journal of Symbolic Logic 43 (1):65-76.
Set mapping reflection.Justin Tatch Moore - 2005 - Journal of Mathematical Logic 5 (1):87-97.

View all 10 references / Add more references