Closure properties of parametric subcompleteness

Archive for Mathematical Logic 57 (7-8):829-852 (2018)
  Copy   BIBTEX

Abstract

For an ordinal \, I introduce a variant of the notion of subcompleteness of a forcing poset, which I call \-subcompleteness, and show that this class of forcings enjoys some closure properties that the original class of subcomplete forcings does not seem to have: factors of \-subcomplete forcings are \-subcomplete, and if \ and \ are forcing-equivalent notions, then \ is \-subcomplete iff \ is. I formulate a Two Step Theorem for \-subcompleteness and prove an RCS iteration theorem for \-subcompleteness which is slightly less restrictive than the original one, in that its formulation is more careful about the amount of collapsing necessary. Finally, I show that an adequate degree of \-subcompleteness follows from the \-distributivity of a forcing, for \.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,642

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The subcompleteness of Magidor forcing.Gunter Fuchs - 2018 - Archive for Mathematical Logic 57 (3-4):273-284.
The subcompleteness of diagonal Prikry forcing.Kaethe Minden - 2020 - Archive for Mathematical Logic 59 (1-2):81-102.
Subcomplete forcing principles and definable well‐orders.Gunter Fuchs - 2018 - Mathematical Logic Quarterly 64 (6):487-504.
Hierarchies of resurrection axioms.Gunter Fuchs - 2018 - Journal of Symbolic Logic 83 (1):283-325.
A Lifting Argument for the Generalized Grigorieff Forcing.Radek Honzík & Jonathan Verner - 2016 - Notre Dame Journal of Formal Logic 57 (2):221-231.
Preserving Non-null with Suslin+ Forcings.Jakob Kellner - 2006 - Archive for Mathematical Logic 45 (6):649-664.
Subcomplete forcing, trees, and generic absoluteness.Gunter Fuchs & Kaethe Minden - 2018 - Journal of Symbolic Logic 83 (3):1282-1305.
Forcing and the halpern–läuchli theorem.Natasha Dobrinen & Daniel Hathaway - 2020 - Journal of Symbolic Logic 85 (1):87-102.

Analytics

Added to PP
2018-01-17

Downloads
6 (#711,559)

6 months
14 (#987,135)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Subcomplete forcing, trees, and generic absoluteness.Gunter Fuchs & Kaethe Minden - 2018 - Journal of Symbolic Logic 83 (3):1282-1305.
Aronszajn tree preservation and bounded forcing axioms.Gunter Fuchs - 2021 - Journal of Symbolic Logic 86 (1):293-315.
Subcomplete forcing principles and definable well‐orders.Gunter Fuchs - 2018 - Mathematical Logic Quarterly 64 (6):487-504.

Add more citations

References found in this work

Saturated ideals.Kenneth Kunen - 1978 - Journal of Symbolic Logic 43 (1):65-76.
The subcompleteness of Magidor forcing.Gunter Fuchs - 2018 - Archive for Mathematical Logic 57 (3-4):273-284.

Add more references