Closure properties of parametric subcompleteness

DOI10.1007/S00153-018-0611-XMaRDI QIDQ1756491zbMATH OpenOpenAlexFDO

Authors Gunter Fuchs

Publication date 14 January 2019

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00153-018-0611-x

zbMATH Keywords

forcing axiomsiterated forcingsubcomplete forcingno new reals

Mathematics Subject Classification ID

Other aspects of forcing and Boolean-valued models (03E40) Generic absoluteness and forcing axioms (03E57)

Recommendations

• Paracompactness and closed subsets
• scientific article; zbMATH DE number 1868891
• scientific article; zbMATH DE number 4126286
• A complexity theory for feasible closure properties
• scientific article; zbMATH DE number 4184405
• Closure Theorem for Partially Semialgebraic Sets
• scientific article; zbMATH DE number 1791082
• The closedness of complete subsemilattices in functionally Hausdorff semitopological semilattices
• scientific article; zbMATH DE number 3256326
• Completeness results for parameterized space classes

Cites work

• Iterated forcing and elementary embeddings
• Saturated ideals
• Subcomplete forcing and \(\mathcal{L}\)-forcing
• Subcomplete forcing, trees, and generic absoluteness
• The subcompleteness of Magidor forcing

Cited in

(7)

• Errata: on the role of the continuum hypothesis in forcing principles for subcomplete forcing
• Canonical fragments of the strong reflection principle
• ARONSZAJN TREE PRESERVATION AND BOUNDED FORCING AXIOMS
• Subcomplete forcing principles and definable well-orders
• The subcompleteness of diagonal Prikry
• Diagonal reflections on squares
• Subcomplete forcing, trees, and generic absoluteness

This page was built for publication: Closure properties of parametric subcompleteness

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