The universal homogeneous binary tree

DOI10.1093/LOGCOM/EXX043zbMATH Open1444.03124arXiv1409.2170OpenAlexW2962949438MaRDI QIDQ4684355FDOQ4684355

Authors: Manuel Bodirsky, David Bradley-Williams, Michael Pinsker, András Pongrácz 

Publication date: 28 September 2018

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Abstract: A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a unique countable existentially closed semilinear order, which we denote by S2. We study the reducts of S2, that is, the relational structures with the same domain as S2 all of whose relations are first-order definable in S2. Our main result is a classification of the model-complete cores of the reducts of S2. From this, we also obtain a classification of reducts up to first-order interdefinability, which is equivalent to a classification of all closed permutation groups that contain the automorphism group of S2.

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

Recommendations

• The reducts of the homogeneous binary branching \(C\)-relation
• On homogeneous semilattices and their automorphism groups
• Countable homogeneous linearly ordered posets
• Countable homogeneous and partially homogeneous ordered structures
• Automorphism Groups of Infinite Semilinear Orders (II)

zbMATH Keywords

permutation groupconstraint satisfaction problemendomorphism monoidmodel companionreductsemilinear ordermodel-complete core

Mathematics Subject Classification ID

Partial orders, general (06A06) Models with special properties (saturated, rigid, etc.) (03C50) Model-theoretic algebra (03C60) Subgroups of symmetric groups (20B35) Basic properties of first-order languages and structures (03C07) Infinite automorphism groups (20B27)

Cited In (12)

• Homogeneous trees are bilipschitz equivalent
• Homogeneous structures: model theory meets universal algebra. Abstracts from the workshop held January 3--9, 2021 (online meeting)
• The reducts of the homogeneous binary branching \(C\)-relation
• Solving infinite-domain CSPs using the patchwork property
• \(2^{\aleph_{0}}\) pairwise nonisomorphic maximal-closed subgroups of \(\mathrm{Sym}(\mathbb N)\) via the classification of the reducts of the Henson digraphs
• Homomorphism order of connected monounary algebras
• Permutation groups with small orbit growth
• Reconstructing the topology on monoids and polymorphism clones of reducts of the rationals
• ON THE AUTOMORPHISM GROUP OF THE UNIVERSAL HOMOGENEOUS MEET-TREE
• Homogenizable structures and model completeness
• The Ubiquitous Digital Tree
• Countable 1-transitive trees

This page was built for publication: The universal homogeneous binary tree

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