Maximally embeddable components

DOI10.1007/s00153-013-0344-9zbMath1302.03053arXiv1303.2591OpenAlexW1986269600MaRDI QIDQ377481

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

posetrelational structureisomorphic substructureforcing equivalents

Mathematics Subject Classification ID

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

Related Items

The poset of all copies of the random graph has the 2-localization property ⋮ Condensational equivalence, equimorphism, elementary equivalence and similar similarities ⋮ Posets of copies of countable scattered linear orders ⋮ Different similarities ⋮ Isomorphic and strongly connected components

Cites Work

• Posets of copies of countable scattered linear orders
• Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
• Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
• FROM A1 TO D5: TOWARDS A FORCING-RELATED CLASSIFICATION OF RELATIONAL STRUCTURES
• Countable Ultrahomogeneous Undirected Graphs
• Unnamed Item
• Unnamed Item