Subcomplete forcing and L-forcing

DOI10.1142/9789814602648_0002MaRDI QIDQ3461817zbMATH OpenOpenAlexFDO

Authors Ronald Jensen

Publication date 18 January 2016

Published in E-Recursion, Forcing and C*-Algebras (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/9789814602648_0002

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Other aspects of forcing and Boolean-valued models (03E40) Ordered sets and their cofinalities; pcf theory (03E04)

Recommendations

• Shelah's work on non-semi-proper iterations, II
• Proper forcing
• Shelah's work on non-semi-proper iterations. I
• Generalized Iteration of Forcing
• More on proper forcing

Cited in

(17)

• A variant of Shelah's characterization of strong Chang's conjecture
• The subcompleteness of Magidor forcing
• Shelah's work on non-semi-proper iterations. I
• Canonical fragments of the strong reflection principle
• Boolean valued semantics for infinitary logics
• Subcomplete forcing principles and definable well-orders
• Forcing axioms and the complexity of non-stationary ideals
• The subcompleteness of diagonal Prikry
• INDESTRUCTIBILITY OF THE TREE PROPERTY
• Singularizing successor cardinals by forcing
• \(\lambda\)-structures and \(s\)-structures: translating the models
• Forcing axioms via ground model interpretations
• Diagonal reflections on squares
• Closure properties of parametric subcompleteness
• Hierarchies of forcing axioms, the continuum hypothesis and square principles
• Hierarchies of (virtual) resurrection axioms
• Subcomplete forcing, trees, and generic absoluteness

This page was built for publication: Subcomplete forcing and \(\mathcal{L}\)-forcing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3461817)