Iteration theorems for subversions of forcing classes

DOI10.1017/JSL.2024.73MaRDI QIDQ6987823zbMATH OpenFDO

Authors Gunter Fuchs, Corey Bacal Switzer

Publication date 6 May 2025

Published in The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/JSL.2024.73

zbMATH Keywords

iterated forcingrevised countable supportsubcomplete forcing

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Cardinal characteristics of the continuum (03E17) Consistency and independence results (03E35) Other aspects of forcing and Boolean-valued models (03E40) Continuum hypothesis and Martin's axiom (03E50) Large cardinals (03E55) Generic absoluteness and forcing axioms (03E57)

Cites work

• E-Recursion, Forcing and C*-Algebras
• Canonical fragments of the strong reflection principle
• Closure properties of parametric subcompleteness
• Diagonal reflections on squares
• Errata: on the role of the continuum hypothesis in forcing principles for subcomplete forcing
• Hierarchies of forcing axioms, the continuum hypothesis and square principles
• scientific article; zbMATH DE number 1741371 (Why is no real title available?)
• On iterating semiproper preorders
• Subcomplete forcing, trees, and generic absoluteness
• The bounded proper forcing axiom

Cited in

(1)

• Separating subversion forcing axioms

This page was built for publication: Iteration theorems for subversions of forcing classes

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