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 PC(T_1, T).
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
We prove the existence of pairs of models of the same cardinality lambda which are very equivalent according to EF games, but not isomorphic. We continue the paper math.LO/0404222, but we don't rely on it.
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 prove that if ZF is consistent then ZFC+GCH is consistent with the following statement: There is for every k<omega a model of cardinality aleph_1 which is L_{infty,omega_1}-equivalent to exactly k non-isomorphic models of cardinality aleph_1. In order to get this result we introduce ladder systems and colourings different from the ``standard'' counterparts, and prove the following purely combinatorial result: For each prime number p and positive integer m it is consistent with ZFC+GCH that there is a ``good'' ladder system having exactly p^m pairwise nonequivalent colourings.
For a cardinal kappa and a model M of cardinality kappa let No(M) denote the number of non-isomorphic models of cardinality kappa which are L_{infty,kappa}--equivalent to M. In [Sh:133] Shelah established that when kappa is a weakly compact cardinal and mu<=kappa is a nonzero cardinal, there exists a model M of cardinality kappa with No(M)=mu. We prove here that if kappa is a weakly compact cardinal, the question of the possible values of No(M) for models M of cardinality kappa is equivalent to the question of the possible numbers of equivalence classes of equivalence relations which are Sigma…
There has been much interest on constructing models which are not isomorphic of cardinality lambda but are equivalent under the Ehrenfeucht-Fraisse game of length alpha even for every alpha<lambda. So under G.C.H. we know much. We deal here with constructions of such pairs of models proven in ZFC and get the existence under mild conditions.
Suppose lambda is a singular cardinal of uncountable cofinality kappa. For a model M of cardinality lambda, let No(M) denote the number of isomorphism types of models N of cardinality lambda which are L_{infty lambda}-equivalent to M. In [Sh:189] inverse kappa-systems A of abelian groups and their certain kind of quotient limits Gr(A)/Fact(A) were considered. It was proved that for every cardinal mu there exists an inverse kappa-system A such that A consists of abelian groups having cardinality at most mu^kappa and card(Gr(A)/Fact(A))= mu. In [Sh:228] a strict connection between inverse kappa-…
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 study how equivalent nonisomorphic models of unsuperstable theories can be. We measure the equivalence by Ehrenfeucht-Fraisse games. This paper continues [HySh:474].
We prove a strengthened version of V. Yu. Shavrukov's result on the non-isomorphism of diagonalizable algebras of two $Σ_1$-sound theories, based on the improvements previously found by G. Adamsson. We then obtain several corollaries to the strengthened result by applying it to various pairs of theories and obtain new non-isomorphism examples. In particular, we show that there is epimorphism from $(\mathfrak{L}_T, \Box_T \Box_T)$ onto $(\mathfrak{L}_T, \Box_T)$. The case of bimodal diagonalizable algebras is also considered. We give several examples of pairs of theories with isomorphic diagona…
The logic L^1_θintroduced in [Sh:797]; it is the maximal logic below L_theta theta in which a well ordering is not definable. We investigate it for theta a compact cardinal. We prove it satisfies several parallel of classical theorems on first order logic, strengthening the thesis that it is a natural logic. In particular, two models are L^1_theta-equivalent iff for some omega-sequence of theta-complete ultrafilters, the iterated ultra-powers by it of those two models are isomorphic.
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…
Part I proved that for every quasivariety K of structures (which may have both operations and relations) there is a semilattice S with operators such that he lattice of quasi-equational theories of K (the dual of the lattice of sub-quasivarieties of K) is isomorphic to Con(S,+,0,F). It is known that if S is a join semilattice with 0 (and no operators), then there is a quasivariety Q such that the lattice of theories of Q is isomorphic to Con(S,+,0). We prove that if S is a semilattice having both 0 and 1 with a group G of operators acting on S, and each operator in G fixes both 0 and 1, then t…
In this note we characterise all finitely generated groups elementarily equivalent to a solvable Baumslag-Solitar group BS$(1,n)$. It turns out that a finitely generated group $G$ is elementarily equivalent to BS$(1,n)$ if and only if $G$ is isomorphic to BS$(1,n)$. Furthermore, we show that two Baumslag-Solitar groups are existentially (universally) equivalent if and only if they are elementarily equivalent if and only if they are isomorphic.
We show that graph products of finite abelian groups are elementarily equivalent if and only if they are $\exists\forall$-equivalent if and only if they are isomorphic. In particular, two right-angled Coxeter groups are elementarily equivalent if and only if they are isomorphic.
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. Analo…
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…
We prove that there exist uncountably many separable II$_1$ factors whose ultrapowers (with respect to arbitrary ultrafilters) are non-isomorphic. In fact, we prove that the families of non-isomorphic II$_1$ factors originally introduced by McDuff \cite{MD69a,MD69b} are such examples. This entails the existence of a continuum of non-elementarily equivalent II$_1$ factors, thus settling a well-known open problem in the continuous model theory of operator algebras.
Induction is typically formalized as a rule or axiom extension of the LK-calculus. While this extension of the sequent calculus is simple and elegant, proof transformation and analysis can be quite difficult. Theories with an induction rule, for example Peano arithmetic do not have a {\em Herbrand} theorem. In this work we extend an existing meta-theoretic formalism, so called proof schemata, a recursive formulation of induction particularly suited for proof analysis, to Peano arithmetic. This relationship provides a meaningful conservative reflection principle between \PA and an alternative p…
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.
Assume a complete superstable theory is superstable, and let P be a class of regular types, typically closed under automorphisms of the monster and non-orthogonality. We define the notion of P-NDOP and prove the existence of P-decompositions and derive an analog of Sh401 for superstable theories with P-NDOP. In this context, we also find a sufficient condition on P-decompositions that imply non-isomorphic models. For this, we investigate natural structures on the types in P\intersect S(M) modulo non-orthogonality.
We extend the classical Feferman-Vaught theorem to logic for metric structures. This implies that the reduced powers of elementarily equivalent structures are elementarily equivalent, and therefore they are isomorphic under the Continuum Hypothesis. We also prove the existence of two separable C*-algebras of the form $\bigoplus_i M_{k(i)}(\mathbb{C})$ such that the assertion that their coronas are isomorphic is independent from ZFC, which gives the first example of genuinely non-commutative coronas of separable C*-algebras with this property.
Irreducible Artin groups of finite type can be parametrized via their associated Coxeter diagrams into six sporadic examples and four infinite families, each of which is further parametrized by the natural numbers. Within each of these four infinite families, we investigate the relationship between elementary equivalence and isomorphism. For three out of the four families, we show that two groups in the same family are equivalent if and only if they are isomorphic; a positive, but weaker, result is also attained for the fourth family. In particular, we show that two braid groups are elementari…
We show that for every quasivariety K of structures (where both functions and relations are allowed) there is a semilattice S with operators such that the lattice of quasi-equational theories of K (the dual of the lattice of sub-quasivarieties of K) is isomorphic to Con(S,+,0,F). As a consequence, new restrictions on the natural quasi-interior operator on lattices of quasi-equational theories are found.
Given two structures $\mathcal{M}$ and $\mathcal{N}$ on the same domain, we say that $\mathcal{N}$ is a reduct of $\mathcal{M}$ if all $\emptyset$-definable relations of $\mathcal{N}$ are $\emptyset$-definable in $\mathcal{M}$. In this article the reducts of the Henson digraphs are classified. Henson digraphs are homogeneous countable digraphs that omit some set of finite tournaments. As the Henson digraphs are $\aleph_0$-categorical, determining their reducts is equivalent to determining all closed supergroups $G<$ Sym$(\mathbb{N})$ of their automorphism groups. A consequence of the classific…
