We classify the computability-theoretic complexity of two index sets of classes of first-order theories: We show that the property of being an $\aleph_0$-categorical theory is $Π^0_3$-complete; and the property of being an Ehrenfeucht theory $Π^1_1$-complete. We also show that the property of having continuum many models is $Σ^1_1$-hard. Finally, as a corollary, we note that the properties of having only decidable models, and of having only computable models, are both $Π^1_1$-complete.
Let (A) and (B) be two first order structures of the same vocabulary. We shall consider the Ehrenfeucht-Fra{i}sse-game of length omega_1 of A and B which we denote by G_{omega_1}(A,B). This game is like the ordinary Ehrenfeucht-Fraisse-game of L_{omega omega} except that there are omega_1 moves. It is clear that G_{omega_1}(A,B) is determined if A and B are of cardinality <= aleph_1. We prove the following results: Theorem A: If V=L, then there are models A and B of cardinality aleph_2 such that the game G_{omega_1}(A,B) is non-determined. Theorem B: If it is consistent that there is a measura…
We prove that it is relatively consistent with ZF + CH that there exist two models of cardinality \aleph_2 such that the second player has a winning strategy in the Ehrenfeucht-Fraïssé-game of length ω_1 but there is no σ-closed back-and-forth set for the two models. If CH fails, no such pairs of models exist.
We generalise the correspondence between $\aleph 0$-categorical theories and their automorphism groups to arbitrary complete theories in classical logic, and to some theories (including, in particular, all $\aleph 0$-categorical ones) in continuous logic.
We provide a description of the structure of $\aleph_0$-categorical trees and cycle-free partial orders. First the maximal branches of $\aleph_0$-categorical tree are examined, followed by the configuration of the ramification orders, which are then combined to provided necessary and sufficient conditions for a tree to be $\aleph_0$-categorical in terms of these two things. The classification of the $\aleph_0$-categorical cycle-free partial orders is found as a corollary.
These notes find a canonical representation of the $\aleph_0$-categorical linear orders based on Joseph Rosenstein's description. A unique minimal representation, called the normal form, is obtained.
We extend the Ahlbrandt--Ziegler analysis of interpretability in aleph_0-categorical structures by showing that existential interpretation is controlled by the monoid of self--embeddings and positive existential interpretation of structures without constant endomorphisms is controlled by the monoid of endomorphisms in the same way as general interpretability is controlled by the automorphism group.
Suppose L is a relational language and P in L is a unary predicate. If M is an L-structure then P(M) is the L-structure formed as the substructure of M with domain {a: M models P(a)}. Now suppose T is a complete first order theory in L with infinite models. Following Hodges, we say that T is relatively lambda-categorical if whenever M, N models T, P(M)=P(N), |P(M)|= lambda then there is an isomorphism i:M-> N which is the identity on P(M). T is relatively categorical if it is relatively lambda-categorical for every lambda. The question arises whether the relative lambda-categoricity of T for s…
We construct non-isomorphic models M, N, e.g. of cardinality aleph_1 such that in the Ehrenfeucht-Fraisse game of length zeta < omega_1 the isomorphism player wins
Shelah has provided sufficient conditions for an $L_{ω_1, ω}$-sentence $ψ$ to have arbitrarily large models and for a Morley-like theorem to hold of $ψ$. These conditions involve structural and set-theoretic assumptions on all the $\aleph_n$'s. Using tools of Boney, Shelah, and the second author, we give assumptions on $\aleph_0$ and $\aleph_1$ which suffice when $ψ$ is restricted to be universal: $\mathbf{Theorem}$ Assume $2^{\aleph_{0}} < 2 ^{\aleph_{1}}$. Let $ψ$ be a universal $L_{ω_{1}, ω}$-sentence. - If $ψ$ is categorical in $\aleph_{0}$ and $1 \leq I(ψ, \aleph_{1}) < 2 ^{\aleph_{1}}$, …
We embed a countably categorical group G into a locally compact group c(G) with a non-trivial topology and study how topological properties of c(G) are connected with the structure of definable subgroups of G.
Essential $\aleph_0$-categoricity; i.e., $\aleph_0$-categoricity in some full countable language, is shown to be a robust notion for strongly minimal compact complex manifolds. Characterisations of triviality and essential $\aleph_0$-categoricity are given in terms of complex-analytic automorphisms, in the simply connected case, and correspondences in general. As a consequence it is pointed out that an example of McMullen yields a strongly minimal compact Kähler manifold with trivial geometry but which is not $\aleph_0$-categorical, giving a counterexample to a conjecture of the second author …
A countable semigroup is $\aleph_0$-categorical if it can be characterised, up to isomorphism, by its first-order properties. In this paper we continue our investigation into the $\aleph_0$-categoricity of semigroups. Our main results are a complete classification of $\aleph_0$-categorical orthodox completely 0-simple semigroups, and descriptions of the $\aleph_0$-categorical members of certain classes of strong semilattices of semigroups.
A sibling of a relational structure $R$ is any structure $S$ which can be embedded into $R$ and, vice versa, in which $R$ can be embedded. Let $sib(R)$ be the number of siblings of $R$, these siblings being counted up to isomorphism. Thomassé conjectured that for countable relational structures made of at most countably many relations, $sib(R)$ is either $1$, countably infinite, or the size of the continuum; but even showing the special case $sib(R)=1$ or infinite is unsettled when $R$ is a countable tree. This is related to Bonato-Tardif conjecture asserting that for every tree $T$ the number…
We study approximate $\aleph_0$-categoricity of theories of beautiful pairs of randomizations, in the sense of continuous logic. This leads us to disprove a conjecture of Ben Yaacov, Berenstein and Henson, by exhibiting $\aleph_0$-categorical, $\aleph_0$-stable metric theories $Q$ for which the corresponding theory $Q_P$ of beautiful pairs is not approximately $\aleph_0$-categorical, i.e., has separable models that are not isomorphic even up to small perturbations of the smaller model of the pair. The theory $Q$ of randomized infinite vector spaces over a finite field is such an example. On th…
We prove an algebraic preservation theorem for positive Horn definability in aleph-zero categorical structures. In particular, we define and study a construction which we call the periodic power of a structure, and define a periomorphism of a structure to be a homomorphism from the periodic power of the structure to the structure itself. Our preservation theorem states that, over an aleph-zero categorical structure, a relation is positive Horn definable if and only if it is preserved by all periomorphisms of the structure. We give applications of this theorem, including a new proof of the know…
This paper has three parts. First, we establish some of the basic model theoretic facts about $M_{\mathcal{T}}$, the Tsirelson space of Figiel and Johnson \cite{FJ}. Second, using the results of the first part, we give some facts about general Banach spaces. Third, we study model-theoretic dividing lines in some Banach spaces and their theories. In~particular, we show: (1) $M_{\mathcal{T}}$ has the \emph{non independence property} (NIP); (2) every Banach space that is $\aleph_0$-categorical up to small perturbations embeds $c_0$ or $\ell_p$ ($1\leqslant p<\infty$) almost isometrically; consequ…
In this paper we initiate the study of $\aleph_0$-categorical semigroups, where a countable semigroup $S$ is $\aleph_0$-categorical if, for any natural number $n$, the action of its group of automorphisms Aut $S$ on $S^n$ has only finitely many orbits. We show that $\aleph_0$-categoricity transfers to certain important substructures such as maximal subgroups and principal factors. We examine the relationship between $\aleph_0$-categoricity and a number of semigroup and monoid constructions, namely direct sums, 0-direct unions, semidirect products and $\mathcal{P}$-semigroups. As a corollary, w…
We investigate the automorphism groups of $\aleph\_0$-categorical structures and prove that they are exactly the Roelcke precompact Polish groups. We show that the theory of a structure is stable if and only if every Roelcke uniformly continuous function on the automorphism group is weakly almost periodic. Analysing the semigroup structure on the weakly almost periodic compactification, we show that continuous surjective homomorphisms from automorphism groups of stable $\aleph\_0$-categorical structures to Hausdorff topological groups are open. We also produce some new WAP-trivial groups and c…
We study automorphism groups of randomizations of separable structures, with focus on the $\aleph_0$-categorical case. We give a description of the automorphism group of the Borel randomization in terms of the group of the original structure. In the $\aleph_0$-categorical context, this provides a new source of Roelcke precompact Polish groups, and we describe the associated Roelcke compactifications. This allows us also to recover and generalize preservation results of stable and NIP formulas previously established in the literature, via a Banach-theoretic translation. Finally, we study and cl…
We show that if A is a linear order then Th(A) is either $\aleph_0$-categorical or Borel complete (in the sense of Friedman and Stanley). We generalize this; if A has countably many unary predicates attached, then Th(A) is $\aleph_0$-categorical, has finitely many countable models (at least three), is Borel equivalent to equality on the reals, is Borel equivalent to "countable sets of reals," or is Borel complete. Furthermore, each of these cases corresponds in a natural way to a count of models of all sizes, up to back-and-forth equivalence. All these cases are possible and we compute precise…
We show that the condition of being categorical in a tail of cardinals can be characterized algebraically for several classes of modules. $Theorem.$ Assume $R$ is an associative ring with unity. 1. The class of locally pure-injective $R$-modules is $λ$-categorical in $all$ $λ> |R|+\aleph_0$ if and only if $R \cong M_n(D)$ for $D$ a division ring and $n \geq 1$. 2. The class of flat $R$-modules is $λ$-categorical in $all$ $λ> |R| + \aleph_0$ if and only if $R \cong M_n(k)$ for $k$ a local ring such that its maximal ideal is left $T$-nilpotent and $n \geq 1$. 3. Assume $R$ is a commutative ring.…
We show that the theory of De Morgan algebras has a model completion and axiomatise it. Then we prove that it is $\aleph_0$-categorical and describe definable and algebraic closures in that theory. We also obtain similar results for Boole-De Morgan algebras.
We give an example of a finite rank, in fact aleph-1 categorical theory where the CBP (canonical base property) does not hold. We include a "group-like" example. We also prove, in a finite Morley rank context, if all definable Galois groups are "rigid" then the theory has the CBP (in a strong sense).
Einstein Institute of Mathematics, The Hebrew University of Jerusalem（爱因斯坦数学研究所，耶路撒冷希伯来大学）；Department of Mathematics, Rutgers University（罗格斯大学数学系）
Let $\mathbf{K}$ be the class of countable structures $M$ with the strong small index property and locally finite algebraicity, and $\mathbf{K}_*$ the class of $M \in \mathbf{K}$ such that $acl_M(\{ a \}) = \{ a \}$ for every $a \in M$. For homogeneous $M \in \mathbf{K}$, we introduce what we call the expanded group of automorphisms of $M$, and show that it is second-order definable in $Aut(M)$. We use this to prove that for $M, N \in \mathbf{K}_*$, $Aut(M)$ and $Aut(N)$ are isomorphic as abstract groups if and only if $(Aut(M), M)$ and $(Aut(N), N)$ are isomorphic as permutation groups. In pa…
Einstein Institute of Mathematics, The Hebrew University of Jerusalem（希伯来大学爱因斯坦数学研究所）；Department of Mathematics, Rutgers University（罗格斯大学数学系）
We show that in algebraically locally finite countable homogeneous structures with a free stationary independence relation the small index property implies the strong small index property. We use this and the main result of [15] to deduce that countable free homogeneous structures in a locally finite relational language have the strong small index property. We also exhibit new continuum sized classes of $\aleph_0$-categorical structures with the strong small index property whose automorphism groups are pairwise non-isomorphic.
This paper builds model-theoretic tools to detect changes in complexity among the simple theories. We develop a generalization of dividing, called shearing, which depends on a so-called context c. This leads to defining c-superstability, a syntactical notion, which includes supersimplicity as a special case. We prove a separation theorem showing that for any countable context c and any two theories $T_1$, $T_2$ such that $T_1$ is c-superstable and $T_2$ is c-unsuperstable, and for arbitrarily large $μ$, it is possible to build models of any theory interpreting both $T_1$ and $T_2$ whose restri…
