Antichains of copies of ultrahomogeneous structures

DOI10.1007/S00153-022-00817-7MaRDI QIDQ2155506zbMATH OpenOpenAlexFDO

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

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

antichainalmost disjoint familystrong amalgamationposet of copiesultrahomogeneous structure

Mathematics Subject Classification ID

Partial orders, general (06A06) Models with special properties (saturated, rigid, etc.) (03C50) Semigroups of transformations, relations, partitions, etc. (20M20) Model theory of denumerable and separable structures (03C15)

Recommendations

• Maximal chains of isomorphic suborders of countable ultrahomogeneous partial orders.
• Positive families and Boolean chains of copies of ultrahomogeneous structures
• Posets of copies of countable ultrahomogeneous tournaments
• Maximal chains of isomorphic subgraphs of countable ultrahomogeneous graphs
• Maximal antichains of isomorphic subgraphs of the Rado graph

Cites work

• scientific article; zbMATH DE number 3823785 (Why is no real title available?)
• scientific article; zbMATH DE number 4010503 (Why is no real title available?)
• scientific article; zbMATH DE number 44603 (Why is no real title available?)
• scientific article; zbMATH DE number 53151 (Why is no real title available?)
• A survey of homogeneous structures
• Copies of the random graph
• Countable Homogeneous Tournaments
• Countable homogeneous partially ordered sets
• Countable homogeneous relational structures and ℵ₀-categorical theories
• Forcing by non-scattered sets
• Forcing with copies of countable ordinals
• From \(A_{1}\) to \(D_{5}\): towards a forcing-related classification of relational structures
• Maximal antichains of isomorphic subgraphs of the Rado graph
• Maximal chains of isomorphic subgraphs of countable ultrahomogeneous graphs
• Maximal chains of isomorphic suborders of countable ultrahomogeneous partial orders.
• Posets of copies of countable scattered linear orders
• Ramsey-type properties of relational structures
• The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
• The poset of all copies of the random graph has the 2-localization property
• Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.

Cited in

(2)

• Posets of copies of countable ultrahomogeneous tournaments
• Antichains of Copies of Ultrahomogeneous Structures

This page was built for publication: Antichains of copies of ultrahomogeneous structures

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