Forcing by non-scattered sets
From MaRDI portal
Publication:435203
DOI10.1016/J.APAL.2012.02.004zbMATH Open1250.03102OpenAlexW2063349669MaRDI QIDQ435203FDOQ435203
Authors: 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
Recommendations
Consistency and independence results (03E35) Other aspects of forcing and Boolean-valued models (03E40) Total orders (06A05)
Cites Work
Cited In (15)
- Oscillation stability for continuous monotone surjections
- Condensational equivalence, equimorphism, elementary equivalence and similar similarities
- Posets of copies of countable ultrahomogeneous tournaments
- Forcing with copies of countable ordinals
- The poset of all copies of the random graph has the 2-localization property
- Posets of copies of countable scattered linear orders
- Different similarities
- Forcing with copies of the Rado and Henson graphs
- Maximal chains of isomorphic suborders of countable ultrahomogeneous partial orders.
- Antichains of copies of ultrahomogeneous structures
- On non-wellfounded iterations of the perfect set forcing
- Isomorphic and strongly connected components
- Copies of the random graph
- Posets of copies of countable non-scattered labeled linear orders
- Maximal chains of copies of the rational line
This page was built for publication: Forcing by non-scattered sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q435203)