The universal homogeneous binary tree

DOI10.1093/logcom/exx043zbMath1444.03124arXiv1409.2170OpenAlexW2962949438MaRDI QIDQ4684355

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

Publication date: 28 September 2018

Published in: Journal of Logic and Computation (Search for Journal in Brave)

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

zbMATH Keywords

permutation groupconstraint satisfaction problemendomorphism monoidmodel companionreductsemilinear ordermodel-complete core

Mathematics Subject Classification ID

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

Related Items (9)

Homogeneous structures: model theory meets universal algebra. Abstracts from the workshop held January 3--9, 2021 (online meeting) ⋮ Homogenizable structures and model completeness ⋮ PAIRWISE NONISOMORPHIC MAXIMAL-CLOSED SUBGROUPS OF SYM(ℕ) VIA THE CLASSIFICATION OF THE REDUCTS OF THE HENSON DIGRAPHS ⋮ Solving infinite-domain CSPs using the patchwork property ⋮ Countable 1-Transitive Trees ⋮ 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

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