The universal homogeneous binary tree

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.

[1]  Michael Pinsker,et al.  Schaefer's Theorem for Graphs , 2015, J. ACM.

[2]  Simon Thomas,et al.  Reducts of the random graph , 1991, Journal of Symbolic Logic.

[3]  Manfred Droste,et al.  Automorphism Groups of Infinite Semilinear Orders (I) , 1989 .

[4]  Peter Jonsson,et al.  Point algebras for temporal reasoning: Algorithms and complexity , 2003, Artif. Intell..

[5]  Rudi Pendavingh,et al.  On the Number of Matroids Compared to the Number of Sparse Paving Matroids , 2014, Electron. J. Comb..

[6]  András Pongrácz.  Reducts of the Henson graphs with a constant , 2017, Ann. Pure Appl. Log..

[7]  Michael Pinsker,et al.  The 42 reducts of the random ordered graph , 2013, 1309.2165.

[8]  Manuel Bodirsky,et al.  Complexity Classification in Infinite-Domain Constraint Satisfaction , 2012, ArXiv.

[9]  Peter Jonsson,et al.  The Reducts of the homogeneous Binary Branching C-Relation , 2016, J. Symb. Log..

[10]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[11]  Manfred Droste,et al.  Automorphism groups of homogeneous semilinear orders: normal subgroups and commutators , 1991 .

[12]  Wilfrid Hodges,et al.  A Shorter Model Theory , 1997 .

[13]  Michael Pinsker,et al.  Reducts of the random partial order , 2011, 1111.7109.

[14]  Manuel Bodirsky,et al.  Determining the consistency of partial tree descriptions , 2007, Artif. Intell..

[15]  P. Cameron.  Transitivity of permutation groups on unordered sets , 1976 .

[16]  Wilfrid Hodges,et al.  Model Theory: The existential case , 1993 .

[17]  Ivo Düntsch,et al.  Relation Algebras and their Application in Temporal and Spatial Reasoning , 2005, Artificial Intelligence Review.

[18]  Michael Pinsker,et al.  Reducts of Ramsey structures , 2011, AMS-ASL Joint Special Session.

[19]  Manfred Droste,et al.  On Homogeneous Semilattices and Their Automorphism Groups , 1999, Order.

[20]  Michael Pinsker,et al.  Decidability of Definability , 2010, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[21]  Manuel Bodirsky,et al.  Ramsey classes: examples and constructions , 2015, Surveys in Combinatorics.

[22]  Manfred Droste,et al.  Structure of partially ordered sets with transitive automorphism groups , 1985 .

[23]  Steven Awodey,et al.  Lawvere–Tierney sheaves in Algebraic Set Theory , 2007, The Journal of Symbolic Logic.

[24]  R. Graham,et al.  Some Recent Developments in Ramsey Theory , 1975 .

[25]  Michael Pinsker,et al.  Permutations on the Random Permutation , 2015, Electron. J. Comb..

[26]  M. Droste.  Partially Ordered Sets with Transitive Automorphism Groups , 1987 .

[27]  Markus Junker,et al.  The 116 reducts of (Q, <, a) , 2008, J. Symb. Log..

[28]  Manuel Bodirsky,et al.  The complexity of temporal constraint satisfaction problems , 2008, STOC.

[29]  Simon Thomas,et al.  Reducts of Random Hypergraphs , 1996, Ann. Pure Appl. Log..

[30]  Tom Cornell.  On Determining the Consistency of Partial Descriptions of Trees , 1994, ACL.

[31]  Manuel Bodirsky.  Cores of Countably Categorical Structures , 2007, Log. Methods Comput. Sci..

[32]  Manuel Bodirsky,et al.  Pure Dominance Constraints , 2002, STACS.

[33]  Michael Pinsker,et al.  Minimal functions on the random graph , 2010 .

[34]  Robin Hirsch,et al.  Relation Algebras of Intervals , 1996, Artif. Intell..

[35]  Markus Junker,et al.  The 116 reducts of (ℚ, <, a) , 2008, Journal of Symbolic Logic.

[36]  Michaël Rusinowitch,et al.  Relating two standard notions of secrecy , 2006, Log. Methods Comput. Sci..

[37]  Peter M. Neumann,et al.  Relations related to betweenness : their structure and automorphisms , 1998 .

[38]  Barnaby Martin,et al.  On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[39]  P. Cameron,et al.  Oligomorphic permutation groups , 1990 .