Forcing by non-scattered sets
From MaRDI portal
Publication:435203
DOI10.1016/j.apal.2012.02.004zbMath1250.03102OpenAlexW2063349669MaRDI QIDQ435203
Miloš S. Kurilić, Stevo Todorčević
Publication date: 11 July 2012
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2012.02.004
Consistency and independence results (03E35) Total orders (06A05) Other aspects of forcing and Boolean-valued models (03E40)
Related Items (13)
The poset of all copies of the random graph has the 2-localization property ⋮ Antichains of copies of ultrahomogeneous structures ⋮ Condensational equivalence, equimorphism, elementary equivalence and similar similarities ⋮ Maximal chains of copies of the rational line ⋮ Posets of copies of countable scattered linear orders ⋮ Posets of copies of countable non-scattered labeled linear orders ⋮ Different similarities ⋮ Forcing with copies of the Rado and Henson graphs ⋮ Oscillation stability for continuous monotone surjections ⋮ Isomorphic and strongly connected components ⋮ Maximal chains of isomorphic suborders of countable ultrahomogeneous partial orders. ⋮ Forcing with copies of countable ordinals ⋮ Copies of the random graph
Cites Work
This page was built for publication: Forcing by non-scattered sets