Isomorphic and strongly connected components

DOI10.1007/s00153-014-0399-2zbMath1373.03052arXiv1311.5049MaRDI QIDQ2257104

Miloš S. Kurilić

Publication date: 23 February 2015

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

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

zbMATH Keywords

poset; forcing; relational structure; isomorphic substructure

Mathematics Subject Classification ID

06A06: Partial orders, general

03C50: Models with special properties (saturated, rigid, etc.)

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

03C15: Model theory of denumerable and separable structures

Related Items

The poset of all copies of the random graph has the 2-localization property, Different similarities, Condensational equivalence, equimorphism, elementary equivalence and similar similarities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximally embeddable components
• Posets of copies of countable scattered linear orders
• Forcing by non-scattered sets
• Countable homogeneous partially ordered sets
• Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
• A survey of homogeneous structures
• FROM A1 TO D5: TOWARDS A FORCING-RELATED CLASSIFICATION OF RELATIONAL STRUCTURES
• Countable Ultrahomogeneous Undirected Graphs
• The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
• Forcing with copies of countable ordinals
• Countable Homogeneous Tournaments