Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 92 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 32 tok/s
GPT-5 High 40 tok/s Pro
GPT-4o 83 tok/s
GPT OSS 120B 467 tok/s Pro
Kimi K2 197 tok/s Pro
2000 character limit reached

Subcomplete forcing, trees and generic absoluteness (1708.08170v2)

Published 28 Aug 2017 in math.LO

Abstract: We investigate properties of trees of height $\omega_1$ and their preservation under subcomplete forcing. We show that subcomplete forcing cannot add a new branch to an $\omega_1$-tree. We introduce fragments of subcompleteness which are preserved by subcomplete forcing, and use these in order to show that certain strong forms of rigidity of Suslin trees are preserved by subcomplete forcings. Finally, we explore under what circumstances subcomplete forcing preserves Aronszajn trees of height and width $\omega_1$. We show that this is the case if CH fails, and if CH holds, then this is the case iff the bounded subcomplete forcing axiom holds. Finally, we explore the relationships between bounded forcing axioms, preservation of Aronszajn trees of height and width $\omega_1$ and generic absoluteness of $\Sigma1_1$-statements over first order structures of size $\omega_1$, also for other canonical classes of forcing.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.