Antichains of copies of ultrahomogeneous structures

DOI10.1007/s00153-022-00817-7MaRDI QIDQ2155506

Boriša Kuzeljević, Miloš S. Kurilić

Publication date: 15 July 2022

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

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

zbMATH Keywords

antichain; almost disjoint family; strong amalgamation; poset of copies; ultrahomogeneous structure

Mathematics Subject Classification ID

06A06: Partial orders, general

20M20: Semigroups of transformations, relations, partitions, etc.

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

03C15: Model theory of denumerable and separable structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The poset of all copies of the random graph has the 2-localization property
• Posets of copies of countable scattered linear orders
• Maximal chains of isomorphic subgraphs of countable ultrahomogeneous graphs
• Forcing by non-scattered sets
• Countable homogeneous partially ordered sets
• Ramsey-type properties of relational structures
• Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
• Copies of the random graph
• Maximal chains of isomorphic suborders of countable ultrahomogeneous partial orders.
• A survey of homogeneous structures
• FROM A1 TO D5: TOWARDS A FORCING-RELATED CLASSIFICATION OF RELATIONAL STRUCTURES
• The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
• Forcing with copies of countable ordinals
• Countable Homogeneous Tournaments
• Maximal antichains of isomorphic subgraphs of the Rado graph
• Countable homogeneous relational structures and ℵ₀-categorical theories