The subcompleteness of diagonal Prikry

DOI10.1007/S00153-019-00678-7zbMATH Open1454.03068arXiv1807.08782OpenAlexW2884424168WikidataQ127863843 ScholiaQ127863843MaRDI QIDQ2288331FDOQ2288331

Kaethe Minden

Publication date: 17 January 2020

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

Abstract: Let $D$ be an infinite discrete set of measurable cardinals. It is shown that generalized Prikry forcing to add a countable sequence to each cardinal in $D$ is subcomplete. To do this it is shown that a simplified version of generalized Prikry forcing which adds a point below each cardinal in $D$, called generalized diagonal Prikry forcing, is subcomplete. Moreover, the generalized diagonal Prikry forcing associated to $D$ is subcomplete above $mu$, where $mu$ is any regular cardinal below the first limit point of $D$.

Full work available at URL: https://arxiv.org/abs/1807.08782

zbMATH Keywords

large cardinalsiterated forcingsubcomplete forcinggeneralized Prikry forcing

Mathematics Subject Classification ID

Other aspects of forcing and Boolean-valued models (03E40) Large cardinals (03E55)

Cites Work

• The subcompleteness of Magidor forcing
• SUBCOMPLETE FORCING AND ℒ-FORCING
• A characterization of generalized Příkrý sequences
• SUBCOMPLETE FORCING, TREES, AND GENERIC ABSOLUTENESS

This page was built for publication: The subcompleteness of diagonal Prikry

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