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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 104,101

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

Forcing axioms, approachability, and stationary set reflection.Sean D. Cox - 2021 - Journal of Symbolic Logic 86 (2):499-530.
Incompatible bounded category forcing axioms.David Asperó & Matteo Viale - 2022 - Journal of Mathematical Logic 22 (2).
Separation problems and forcing.Jindřich Zapletal - 2013 - Journal of Mathematical Logic 13 (1):1350002.
Bounded forcing axioms as principles of generic absoluteness.Joan Bagaria - 2000 - Archive for Mathematical Logic 39 (6):393-401.
On the Set-Generic Multiverse.Sy-David Friedman, Sakaé Fuchino & Hiroshi Sakai - 2018 - In Carolin Antos, Sy-David Friedman, Radek Honzik & Claudio Ternullo, The Hyperuniverse Project and Maximality. Basel, Switzerland: Birkhäuser. pp. 109-124.
A maximal bounded forcing axiom.David Asperó - 2002 - Journal of Symbolic Logic 67 (1):130-142.
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
31 (#795,683)

6 months
6 (#697,129)

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

Saturated ideals.Kenneth Kunen - 1978 - Journal of Symbolic Logic 43 (1):65-76.
Bounded forcing axioms as principles of generic absoluteness.Joan Bagaria - 2000 - Archive for Mathematical Logic 39 (6):393-401.
Set mapping reflection.Justin Tatch Moore - 2005 - Journal of Mathematical Logic 5 (1):87-97.

View all 8 references / Add more references