English

Forcing with matrices of countable elementary submodels

Logic 2015-08-18 v2

Abstract

We analyze the forcing notion P\mathcal P of finite matrices whose rows consists of isomorphic countable elementary submodels of a given structure of the form HθH_{\theta}. We show that forcing with this poset adds a Kurepa tree TT. Moreover, if Pc\mathcal P_c is a suborder of P\mathcal P containing only continuous matrices, then the Kurepa tree TT is almost Souslin, i.e. the level set of any antichain in TT is not stationary in ω1\omega_1.

Keywords

Cite

@article{arxiv.1503.08352,
  title  = {Forcing with matrices of countable elementary submodels},
  author = {Borisa Kuzeljevic and Stevo Todorcevic},
  journal= {arXiv preprint arXiv:1503.08352},
  year   = {2015}
}
R2 v1 2026-06-22T09:04:38.724Z