Posets of copies of countable scattered linear orders

DOI10.1016/J.APAL.2013.11.005zbMATH Open1297.06001arXiv1303.2598OpenAlexW2594527116MaRDI QIDQ386154FDOQ386154

Authors: Miloš S. Kurilić 

Publication date: 16 December 2013

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

Abstract: We show that the separative quotient of the poset (P(L),subset) of isomorphic suborders of a countable scattered linear order L is sigma-closed and atomless. So, under the CH, all these posets are forcing-equivalent (to P(omega)/Fin).

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

Recommendations

• Posets of copies of countable non-scattered labeled linear orders
• Forcing by non-scattered sets
• Forcing with copies of countable ordinals
• A scattering of orders
• A poset hierarchy

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Theory of relations. Transl. from the French by P. Clote
• Title not available (Why is that?)
• On Fraissé's order type conjecture
• Maximally embeddable components
• Forcing by non-scattered sets
• Title not available (Why is that?)
• Distributivity of quotients of countable products of Boolean algebras
• Title not available (Why is that?)

Cited In (14)

• Condensational equivalence, equimorphism, elementary equivalence and similar similarities
• Forcing with copies of countable ordinals
• The poset of all copies of the random graph has the 2-localization property
• Maximally embeddable components
• Forcing by non-scattered sets
• Different similarities
• Countable homogeneous linearly ordered posets
• Maximal chains of isomorphic suborders of countable ultrahomogeneous partial orders.
• LATIN 2004: Theoretical Informatics
• Antichains of copies of ultrahomogeneous structures
• Isomorphic and strongly connected components
• A poset hierarchy
• Copies of the random graph
• Posets of copies of countable non-scattered labeled linear orders

This page was built for publication: Posets of copies of countable scattered linear orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q386154)