SUBCOMPLETE FORCING AND ℒ-FORCING
From MaRDI portal
Publication:3461817
DOI10.1142/9789814602648_0002zbMath1351.03044OpenAlexW4234339746MaRDI QIDQ3461817
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
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)
Related Items (15)
Forcing axioms and the complexity of non-stationary ideals ⋮ Boolean valued semantics for infinitary logics ⋮ INDESTRUCTIBILITY OF THE TREE PROPERTY ⋮ Singularizing successor cardinals by forcing ⋮ Subcomplete forcing principles and definable well‐orders ⋮ \(\lambda\)-structures and \(s\)-structures: translating the models ⋮ Forcing axioms via ground model interpretations ⋮ Diagonal reflections on squares ⋮ HIERARCHIES OF FORCING AXIOMS, THE CONTINUUM HYPOTHESIS AND SQUARE PRINCIPLES ⋮ HIERARCHIES OF (VIRTUAL) RESURRECTION AXIOMS ⋮ The subcompleteness of Magidor forcing ⋮ Canonical fragments of the strong reflection principle ⋮ Closure properties of parametric subcompleteness ⋮ SUBCOMPLETE FORCING, TREES, AND GENERIC ABSOLUTENESS ⋮ The subcompleteness of diagonal Prikry
This page was built for publication: SUBCOMPLETE FORCING AND ℒ-FORCING
