Forcing and Construction Schemes
Damjan Kalajdzievski, Fulgencio Lopez

TL;DR
This paper explores the relationships between forcing, construction schemes, and combinatorial principles, showing how adding Cohen reals influences the existence of capturing schemes and their hierarchy.
Contribution
It demonstrates the consistency of having n-capturing schemes without (n+1)-capturing schemes and clarifies their relation to the m-Knaster hierarchy.
Findings
Adding Cohen reals creates capturing construction schemes.
n-capturing schemes can exist without (n+1)-capturing schemes.
Independence and incompatibility results between n-capturing and m-Knaster principles.
Abstract
We investigate forcing and independence questions relating to construction schemes. We show that adding Cohen reals adds a capturing construction scheme. We study the weaker structure of -capturing construction schemes and show that it is consistent to have -capturing construction schemes but no -capturing construction schemes. We also study the relation of -capturing with the -Knaster hierarchy and show that MAK and -capturing are independent if and incompatible if .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Rings, Modules, and Algebras
