Closure properties of parametric subcompleteness

DOI10.1007/S00153-018-0611-XOpenAlexW2783241777MaRDI QIDQ1756491

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

iterated forcingforcing axiomssubcomplete forcingno new reals

Mathematics Subject Classification ID

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

Related Items (5)

Subcomplete forcing principles and definable well‐orders ⋮ Diagonal reflections on squares ⋮ Canonical fragments of the strong reflection principle ⋮ SUBCOMPLETE FORCING, TREES, AND GENERIC ABSOLUTENESS ⋮ ARONSZAJN TREE PRESERVATION AND BOUNDED FORCING AXIOMS

Cites Work

• The subcompleteness of Magidor forcing
• Iterated Forcing and Elementary Embeddings
• SUBCOMPLETE FORCING AND ℒ-FORCING
• Saturated ideals
• SUBCOMPLETE FORCING, TREES, AND GENERIC ABSOLUTENESS

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