Posets of copies of countable scattered linear orders

DOI10.1016/j.apal.2013.11.005zbMath1297.06001arXiv1303.2598OpenAlexW2594527116MaRDI QIDQ386154

Miloš S. Kurilić

Publication date: 16 December 2013

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.2598

zbMATH Keywords

forcingisomorphic substructure\(\sigma\)-closed posetdenumerable structurescattered linear order

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Continuum hypothesis and Martin's axiom (03E50) Total orders (06A05) Other aspects of forcing and Boolean-valued models (03E40) Model theory of denumerable and separable structures (03C15)

Related Items

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 ⋮ Maximally embeddable components ⋮ Posets of copies of countable non-scattered labeled linear orders ⋮ Different similarities ⋮ 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

• Maximally embeddable components
• Forcing by non-scattered sets
• Theory of relations. Transl. from the French by P. Clote
• On Fraissé's order type conjecture
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item