We work in the context of ω-stable theories. We obtain a natural, algebraic equivalent of ENI-NDOP and discuss recent joint proofs with Shelah that if an ω-stable theory has either ENI-DOP or is ENI-NDOP and is ENI-deep, then the set of models of T with universe ω is Borel complete.

The main results in the paper are the following. Theorem A. Suppose that T is superstable and M ⊂ N are distinct models of T eq . Then there is a c ϵ N⧹M such that t is regular. For M ⊂ N two models we say that M ⊂ na N if for all a ϵ M and θ such that θ ≠ θ , there is a b ∈ θ ⧹ acl . Theorem B Suppose that T is (...) superstable , M ⊂ na N are models of T eq , and p is a regular type non-orthogonal to t . Then there is a c ϵ N such that t is regular and non-orthogonal to p. Furthermore, there is a formula θ ∈ t such that a ∈ θ and t ⊥ ̷ p ⇒ t is regular. We used these results to obtain ‘good’ tree decompositions of models in superstable theories with NDOP. See Definition 5.1 for the undefined terms. Theorem C Suppose that T is superstable with NDOP and M ⊨ T eq . Then every ⊂ na - decomposition inside M extends to a ⊂ na -decomposition of M. Furthermore, if 〈N η , a η : η ∈ I〉 is any ⊂ na -decomposition of M, then M is minimal over ∪N η and for all η ∈ I. M is dominated by ∪N η over N η . Using some stable group theory we show that when Th is superstable with NDOP and 〈 N η : η ∈ I 〉 is a tree decomposition of M, then M is constructible over ∪ n η with respect to a very strong isolation relation. (shrink)

It follows directly from Shelah’s structure theory that if T is a classifiable theory, then the isomorphism type of any model of T is determined by the theory of that model in the language L∞,ω1. Leo Harrington asked if one could improve this to the logic L∞, In [S. Shelah, Characterizing an -saturated model of superstable NDOP theories by its L∞,-theory, Israel Journal of Mathematics 140 61–111] Shelah gives a partial positive answer, showing that for T a countable superstable NDOP (...) theory, two -saturated models of T are isomorphic if and only if they have the same L∞,-theory. We give here a negative answer to the general question by constructing two classifiable theories, each with 21 pairwise non-isomorphic models of cardinality 1, which are all L∞,-equivalent, a shallow depth 3 ω-stable theory and a shallow NOTOP depth 1 superstable theory. In the other direction, we show that in the case of an ω-stable depth 2 theory, the L∞,-theory is enough to describe the isomorphism type of all models. (shrink)

In this paper, I present a class of ‘structural’ abstraction principles, and describe how they are suggested by some features of Cantor's and Dedekind's approach to abstraction. Structural abstraction is a promising source of mathematically tractable new axioms for the neo-logicist. I illustrate this by showing, first, how a theorem of Shelah gives a sufficient condition for consistency in the structural setting, solving what neo-logicists call the ‘bad company’ problem for structural abstraction. Second, I show how, in the structural setting, (...) we can measure the logical strength of abstraction principles using categories of interpretations between theories. (shrink)

We give here alternative definitions for the notions that S. Shelah has introduced in recent papers: the dimensional order property and the depth of a theory. We will also give a proof that the depth of a countable theory, when defined, is an ordinal recursive in T.

If T is an unstable theory of cardinality <λ or countable stable theory with OTOP or countable superstable theory with DOP, λω λω1 in the superstable with DOP case) is regular and λ<λ=λ, then we construct for T strongly equivalent nonisomorphic models of cardinality λ. This can be viewed as a strong nonstructure theorem for such theories. We also consider the case when T is unsuperstable and develop further a result of Shelah about the existence of L∞,λ-equivalent nonisomorphic models for (...) such T. In addition, we show that a natural analogue of Scott's isomorphism theorem fails for models of power κ, if κω is regular, assuming κ<κ=κ. (shrink)

We prove the Main Gap for the class of a -models (sufficiently saturated models) of an arbitrary stable 1-based theory T . We (i) prove a strong structure theorem for a -models, assuming NDOP, and (ii) roughly compute the number of a -models of T in any given cardinality. The analysis uses heavily group existence theorems in 1-based theories.

We consider the question of when, given a subset A of M, the setwise stabilizer of the group of automorphisms induces a closed subgroup on Sym(A). We define s-homogeneity to be the analogue of homogeneity relative to strong embeddings and show that any subset of a countable, s-homogeneous, ω-stable structure induces a closed subgroup and contrast this with a number of negative results. We also show that for ω-stable structures s-homogeneity is preserved under naming countably many constants, but under slightly (...) weaker conditions it can be lost by naming a single point. (shrink)

Let S and T be countable complete theories. We assume that T is superstable without the dimensional order property, and S is interpretable in T in such a way that every model of S is coded in a model of T. We show that S does not have the dimensional order property, and we discuss the question of whether $\operatorname{Depth}(S) \leq \operatorname{Depth}(T)$ . For Mekler's uniform interpretation of arbitrary theories S of finite similarity type into suitable theories T s of (...) groups we show that $\operatorname{Depth}(S) \leq \operatorname{Depth}(T_S) \leq 1 + \operatorname{Depth}(S)$. (shrink)

We relate the classifiability of a complete finitary first-order theory in the sense of S. SHELAH to the determinacy of the class of -saturated models in the sense of stationary logic.