Posets of copies of countable scattered linear orders

DOI10.1016/j.apal.2013.11.005zbMath1297.06001arXiv1303.2598MaRDI 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

forcing; isomorphic substructure; \(\sigma\)-closed poset; denumerable structure; scattered linear order

Mathematics Subject Classification ID

06A07: Combinatorics of partially ordered sets

03E50: Continuum hypothesis and Martin's axiom

06A05: Total orders

03E40: Other aspects of forcing and Boolean-valued models

03C15: Model theory of denumerable and separable structures

Related Items

Forcing with copies of countable ordinals, The poset of all copies of the random graph has the 2-localization property, Maximally embeddable components, Different similarities, Copies of the random graph, Antichains of copies of ultrahomogeneous structures, Posets of copies of countable non-scattered labeled linear orders, Isomorphic and strongly connected components, Maximal chains of isomorphic suborders of countable ultrahomogeneous partial orders., Condensational equivalence, equimorphism, elementary equivalence and similar similarities

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