The structures $\langle M,\subseteq^M\rangle$ arising as the inclusion relation of a countable model of sufficient set theory $\langle M,\in^M\rangle$, whether well-founded or not, are all isomorphic. These structures $\langle M,\subseteq^M\rangle$ are exactly the countable saturated models of the theory of set-theoretic mereology: an unbounded atomic relatively complemented distributive lattice. A very weak set theory suffices, even finite set theory, provided that one excludes the $ω$-standard models with no infinite sets and the $ω$-standard models of set theory with an amorphous set. Analogous results hold also for class theories such as Gödel-Bernays set theory and Kelley-Morse set theory.
It is well-known that the first order Peano axioms PA have a continuum of non-isomorphic countable models. The question, how close to being isomorphic such countable models can be, seems to be less investigated. A measure of closeness to isomorphism of countable models is the length of back-and-forth sequences that can be established between them. We show that for every countable ordinal alpha there are countable non-isomorphic models of PA with a back-and-forth sequence of length alpha between them. This implies that the Scott height (or rank) of such models is bigger than $α$. We also prove …
We investigate the poset (P(X),\subset), where P(X) is the set of isomorphic suborders of a countable ultrahomogeneous partial order X. For X different from (resp. equal to) a countable antichain the order types of maximal chains in (P(X)\cup \{\emptyset \},\subset) are characterized as the order types of compact (resp. compact and nowhere dense) sets of reals having the minimum non-isolated.
A topological monoid is isomorphic to an endomorphism monoid of a countable structure if and only if it is separable and has a compatible complete ultrametric such that composition from the left is non-expansive. We also give a topological characterisation of those topological monoids that are isomorphic to endomorphism monoids of countable omega-categorical structures. Finally we present analogous characterisations for polymorphism clones of countable structures and for polymorphism clones of countable omega-categorical structures.
For a countable ultrahomogeneous graph G let P(G) denote the collection of domains of subgraphs of G isomorphic to G. The order types of maximal chains in the set P(G) U ø ordered by the inclusion are characterized as: (I) the order types of compact sets of reals having the minimum non-isolated, if G is the Rado graph or the Henson graph H_n, for some n>2; (II) the order types of compact nowhere dense sets of reals having the minimum non-isolated, if G is the union of μdisjoint complete graphs of size ν, where μν=ω.
The Hebrew University of Jerusalem（耶路撒冷希伯来大学）；Rutgers University（罗格斯大学）
For every countable structure $M$ we construct an $\aleph_0$-stable countable structure $N$ such that $Aut(M)$ and $Aut(N)$ are topologically isomorphic. This shows that it is impossible to detect any form of stability of a countable structure $M$ from the topological properties of the Polish group $Aut(M)$.
We show that the separative quotient of the poset (P(L),\subset) of isomorphic suborders of a countable scattered linear order L is σ-closed and atomless. So, under the CH, all these posets are forcing-equivalent (to P(ω)/Fin).
If M,N are countable, arithmetically saturated models of Peano Arithmetic and Aut(M) is isomorphic to Aut(N), then the Turing-jumps of Th(M) and Th(N) are recursively equivalent.
Let αbe a countable ordinal and ¶(α) the collection of its subsets isomorphic to α. We show that the separative quotient of the set ¶(α) ordered by the inclusion is isomorphic to a forcing product of iterated reduced products of Boolean algebras of the form P(ω^γ)/I(ω^γ), where γis a limit ordinal or 1 and I(ω^γ) the corresponding ordinal ideal. Moreover, the poset ¶(α) is forcing equivalent to a two-step iteration P(ω)/Fin * π, where πis an ω_1-closed separative pre-order in each extension by P(ω)/Fin and, if the distributivity number is equal toω_1, to P(ω)/Fin. Also we analyze the quotients…
The main theorem of this article is that every countable model of set theory M, including every well-founded model, is isomorphic to a submodel of its own constructible universe. In other words, there is an embedding $j:M\to L^M$ that is elementary for quantifier-free assertions. The proof uses universal digraph combinatorics, including an acyclic version of the countable random digraph, which I call the countable random Q-graded digraph, and higher analogues arising as uncountable Fraisse limits, leading to the hypnagogic digraph, a set-homogeneous, class-universal, surreal-numbers-graded acy…
We say that an ideal I is homogeneous, if its restriction to any I-positive subset is isomorphic to I. The paper investigates basic properties of this notion -- we give examples of homogeneous ideals and present some applications to topology and ideal convergence. Moreover, we answer questions related to our research.
We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an uncountable set of countable models that are pairwise separable, then actually it has such a set of size $2^{\aleph_0}$. Our result follows trivially assuming the Continuum Hypothesis ($CH$). We work here in $ZFC$ (only without $CH$).
We continue the study of the theories of Baldwin-Shi hypergraphs from $[5]$. Restricting our attention to when the rank $δ$ is rational valued, we show that each countable model of the theory of a given Baldwin-Shi hypergraph is isomorphic to a generic structure built from some suitable subclass of the original class of finite structures with the inherited notion of strong substructure. We introduce a notion of dimension for a model and show that there is a an elementary chain $\{\mathfrak{M}_β:β<ω+1\}$ of countable models of the theory of a fixed Baldwin-Shi hypergraph with $\mathfrak{M}_β\pr…
A complete first order theory of a relational signature is called monomorphic iff all its models are monomorphic (i.e. have all the $n$-element substructures isomorphic, for each positive integer $n$). We show that a complete theory ${\mathcal T}$ having infinite models is monomorphic iff it has a countable monomorphic model and confirm the Vaught conjecture for monomorphic theories. More precisely, we prove that if ${\mathcal T}$ is a complete monomorphic theory having infinite models, then the number of its non-isomorphic countable models, $I({\mathcal T},ω)$, is either equal to $1$ or to ${…
We present an example of two countable $ω$-categorical structures, one of which has a finite relational language, whose endomorphism monoids are isomorphic as abstract monoids, but not as topological monoids -- in other words, no isomorphism between these monoids is a homeomorphism. For the same two structures, the automorphism groups and polymorphism clones are isomorphic, but not topologically isomorphic. In particular, there exists a countable $ω$-categorical structure in a finite relational language which can neither be reconstructed up to first-order bi-interpretations from its automorphi…
We show that in the aleph_2-stage countable support iteration of Mathias forcing over a model of CH the complete Boolean algebra generated by absolutely divergent series under eventual dominance is not isomorphic to the completion of P(omega)/fin. This complements Vojtas' result, that under cf(c)=p the two algebras are isomorphic
We prove that the Fraïssé limit of a Fraïssé class $\mathcal C$ is the (unique) countable structure whose isomorphism type is comeager (with respect to a certain logic topology) in the Baire space of all structures whose age is contained in $\mathcal C$ and which are defined on a fixed countable universe. In particular, the set of groups isomorphic to Hall's universal group is comeager in the space of all countable locally finite groups and the set of fields isomorphic to the algebraic closure of $\mathbb F_p$ is comeager in the space of countable fields of characteristic $p$.
Our "long term and large scale" aim is to characterize the first order theories T (at least the countable ones) such that: for every ordinal alpha there lambda,M_1,M_2 such that M_1,M_2 are non-isomorphic models of T of cardinality lambda which are EF_{alpha, lambda}-equivalent. We expect that as in the main gap we get a strong dichotomy, so in the non-structure side we have stronger, better examples, and in the structure side we have a parallel of [Sh:c,XIII]. We presently prove the consistency of the non-structure side for T which is aleph_0-independent (= not strongly dependent), even for P…
We study the partial orderings of the form $\langle {\mathbb P} ({\mathbb X}), \subset \rangle $, where ${\mathbb X}$ is a binary relational structure with the connectivity components isomorphic to a strongly connected structure ${\mathbb Y}$ and ${\mathbb P} ({\mathbb X})$ is the set of (domains of) substructures of ${\mathbb X}$ isomorphic to ${\mathbb X}$. We show that, for example, for a countable ${\mathbb X}$, the poset $\langle {\mathbb P} ({\mathbb X}), \subset \rangle $ is either isomorphic to a finite power of ${\mathbb P} ({\mathbb Y})$ or forcing equivalent to a separative atomless…
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.
We prove that, consistently with ZFC, no ultraproduct of countably infinite (or separable metric, non-compact) structures is isomorphic to a reduced product of countable (or separable metric) structures associated to the Fréchet filter. Since such structures are countably saturated, the Continuum Hypothesis implies that they are isomorphic when elementarily equivalent.
The degree spectrum of a countable structure is the set of all Turing degrees of presentations of that structure. We show that every nonlow Turing degree lies in the spectrum of some differentially closed field (of characteristic 0, with a single derivation) whose spectrum does not contain the computable degree 0. Indeed, this is an equivalence, for we also show that every such field of low degree is isomorphic to a computable differential field. Relativizing the latter result and applying a theorem of Montalban, Soskova, and Soskov, we conclude that the spectra of countable differentially clo…
For a class $\mathcal K$ of countable relational structures, a countable Borel equivalence relation $E$ is said to be $\mathcal K$-structurable if there is a Borel way to put a structure in $\mathcal K$ on each $E$-equivalence class. We study in this paper the global structure of the classes of $\mathcal K$-structurable equivalence relations for various $\mathcal K$. We show that $\mathcal K$-structurability interacts well with several kinds of Borel homomorphisms and reductions commonly used in the classification of countable Borel equivalence relations. We consider the poset of classes of $\…
We investigate the structure of the monoid of endomorphisms of the ordered set $(\mathbb{Q},{\leq})$ of rational numbers. We show that for any countable linearly ordered set $Ω$, there are uncountably many maximal subgroups of $\operatorname{End}(\mathbb{Q},{\leq})$ isomorphic to the automorphism group of $Ω$. We characterise those subsets $X$ of $\mathbb{Q}$ that arise as a retract in $(\mathbb{Q},{\leq})$ in terms of topological information concerning $X$. Finally, we establish that a countable group arises as the automorphism group of a countable linearly ordered set, and hence as a maximal…
The Turing degree spectrum of a countable structure $\mathcal{A}$ is the set of all Turing degrees of isomorphic copies of $\mathcal{A}$. The Turing degree of the isomorphism type of $\mathcal{A}$, if it exists, is the least Turing degree in its degree spectrum. We show there are countable fields, rings, and torsion-free abelian groups of arbitrary rank, whose isomorphism types have arbitrary Turing degrees. We also show that there are structures in each of these classes whose isomorphism types do not have Turing degrees.
We show that a Borel action of a standard Borel group which is isomorphic to a sum of a countable abelian group with a countable sum of real lines and circles induces an orbit equivalence relation which is hypersmooth, i.e., Borel reducible to eventual agreement on sequences of reals, and it follows from this result along with the structure theory for locally compact abelian groups that Borel actions of Polish LCA groups induce orbit equivalence relations which are essentially hyperfinite, extending a result of Gao and Jackson and answering a question of Ding and Gao.
Let $\mathrm{G}$ be a subgroup of the symmetric group $\mathfrak S(U)$ of all permutations of a countable set $U$. Let $\overline{\mathrm{G}}$ be the topological closure of $\mathrm{G}$ in the function topology on $U^U$. We initiate the study of the poset $\overline{\mathrm{G}}[U]:=\{f[U]\mid f\in \overline{\mathrm{G}}\}$ of images of the functions in $\overline{\mathrm{G}}$, being ordered under inclusion. This set $\overline{\mathrm{G}}[U]$ of subsets of the set $U$ will be called the \emph{poset of copies for} the group $\mathrm{G}$. A denomination being justified by the fact that for every …
