Maximally embeddable components

DOI10.1007/S00153-013-0344-9MaRDI QIDQ377481zbMATH OpenOpenAlexFDO

Authors Miloš S. Kurilić

Publication date 6 November 2013

Published in Archive for Mathematical Logic (Search for Journal in Brave)

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

zbMATH Keywords

forcing equivalentsisomorphic substructureposetrelational structure

Mathematics Subject Classification ID

Model theory of denumerable and separable structures (03C15) Other aspects of forcing and Boolean-valued models (03E40)

Abstract: We investigate the partial orderings of the form (P(X),subset), where X is a countable binary relational structure and P(X) the set of the domains of its isomorphic substructures and show that if the components of X are maximally embeddable and satisfy an additional condition related to connectivity, then the poset (P(X),subset) is forcing equivalent to a finite power of (P(omega)/Fin)^+, or to (P(omega imes omega)/(Fin imes Fin))^+, or to the direct product (P(Delta)/ED_fin)^+ imes ((P(omega)/Fin)^+)^n, for some n in omega. In particular we obtain forcing equivalents of the posets of copies of countable equivalence relations, disconnected ultrahomogeneous graphs and some partial orderings.

Recommendations

• The joint embedding property and maximal models
• Maximum genus of strong embeddings
• scientific article; zbMATH DE number 942688
• scientific article; zbMATH DE number 5145450
• Embeddability of the combinohedron
• On strong embeddability and finite decomposition complexity
• Extremal properties of principal embeddings
• Embeddings of Decomposition Spaces
• Maximal elements and equilibria of condensing multimaps
• Almost-compact embeddings

Cites work

• Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
• Countable Ultrahomogeneous Undirected Graphs
• Distributivity of quotients of countable products of Boolean algebras
• From \(A_{1}\) to \(D_{5}\): towards a forcing-related classification of relational structures
• scientific article; zbMATH DE number 1228763 (Why is no real title available?)
• Posets of copies of countable scattered linear orders
• Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.

Cited in

(9)

• Posets of copies of countable non-scattered labeled linear orders
• Isomorphic and strongly connected components
• Condensational equivalence, equimorphism, elementary equivalence and similar similarities
• The poset of all copies of the random graph has the 2-localization property
• From \(A_{1}\) to \(D_{5}\): towards a forcing-related classification of relational structures
• Posets of copies of countable scattered linear orders
• Posets of isomorphic substructures of relational structures
• The components of maximum
• Different similarities

This page was built for publication: Maximally embeddable components

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