From A₁ to D₅: towards a forcing-related classification of relational structures

DOI10.1017/JSL.2013.26MaRDI QIDQ2921034zbMATH OpenOpenAlexFDO

Authors Miloš S. Kurilić

Publication date 30 September 2014

Published in The Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

forcingposetisomorphic substructurerelational structure

Mathematics Subject Classification ID

Partial orders, general (06A06) Other aspects of forcing and Boolean-valued models (03E40) Model theory of denumerable and separable structures (03C15)

Abstract: We investigate the partial orderings of the form (P(X),subset), where X is a relational structure and P(X) the set of the domains of its isomorphic substructures. A rough classification of countable binary structures corresponding to the forcing-related properties of the posets of their copies is obtained.

Recommendations

• Maximally embeddable components
• A Classification of Transitive Relations on ω₁
• Isomorphic and strongly connected components
• Posets of isomorphic substructures of relational structures
• Forcing a countable structure to belong to the ground model

Cites work

• scientific article; zbMATH DE number 722611 (Why is no real title available?)
• Compacts de fonctions mesurables et filtres non mesurables
• Set theory. An introduction to independence proofs

Cited in

(14)

• Posets of isomorphic substructures of relational structures
• Condensational equivalence, equimorphism, elementary equivalence and similar similarities
• Posets of copies of countable ultrahomogeneous tournaments
• The poset of all copies of the random graph has the 2-localization property
• Forcing with copies of countable ordinals
• Maximally embeddable components
• Different similarities
• Forcing with copies of the Rado and Henson graphs
• A Classification of Transitive Relations on ω₁
• Reversibility of disconnected structures
• Antichains of copies of ultrahomogeneous structures
• Isomorphic and strongly connected components
• Copies of the random graph
• A note on strongly Jónsson binary relational structures.

This page was built for publication: From \(A_{1}\) to \(D_{5}\): towards a forcing-related classification of relational structures

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