Forcing with matrices of countable elementary submodels
Borisa Kuzeljevic, Stevo Todorcevic

TL;DR
This paper studies a forcing notion based on matrices of countable elementary submodels, showing it adds a Kurepa tree with specific properties, including being almost Souslin under certain conditions.
Contribution
It introduces a new forcing construction using matrices of models and analyzes the properties of the resulting Kurepa trees, including their Souslin characteristics.
Findings
Forcing with matrices adds a Kurepa tree.
Suborder with continuous matrices yields an almost Souslin tree.
The constructed trees have specific stationary set properties.
Abstract
We analyze the forcing notion of finite matrices whose rows consists of isomorphic countable elementary submodels of a given structure of the form . We show that forcing with this poset adds a Kurepa tree . Moreover, if is a suborder of containing only continuous matrices, then the Kurepa tree is almost Souslin, i.e. the level set of any antichain in is not stationary in .
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.
