THE HANF NUMBER FOR AMALGAMATION OF COLORING CLASSES

We study amalgamation properties in a family of abstract elementary classes that we call coloring classes. The family includes the examples previously studied in [3]. We establish that the amalgamation property is equivalent to the disjoint amalgamation property in all coloring classes; find the Hanf number for the amalgamation property for coloring classes; and improve the results of [3] by showing, in ZFC, that the (disjoint) amalgamation property for classes Kα studied in that paper must hold up to ℶα (only a consistency result was previously known).

GALOIS-STABILITY FOR TAME ABSTRACT ELEMENTARY CLASSES

We introduce tame abstract elementary classes as a generalization of all cases of abstract elementary classes that are known to permit development of stability-like theory. In this paper, we explore stability results in this new context. We assume that [Formula: see text] is a tame abstract elementary class satisfying the amalgamation property with no maximal model. The main results include:. Theorem 0.1. Suppose that [Formula: see text] is not only tame, but [Formula: see text]-tame. If [Formula: see text] and [Formula: see text] is Galois stable in μ, then [Formula: see text], where [Formula: see text] is a relative of κ(T) from first order logic. [Formula: see text] is the Hanf number of the class [Formula: see text]. It is known that [Formula: see text]. The theorem generalizes a result from [17]. It is used to prove both the existence of Morley sequences for non-splitting (improving [22, Claim 4.15] and a result from [7]) and the following initial step towards a stability spectrum theorem for tame classes:. Theorem 0.2. If [Formula: see text] is Galois-stable in some [Formula: see text], then [Formula: see text] is stable in every κ with κμ=κ. For example, under GCH we have that [Formula: see text] Galois-stable in μ implies that [Formula: see text] is Galois-stable in μ+n for all n < ω.

Omitting types in -minimal theories

Let L be a first order language containing a binary relation symbol <.Definition. Suppose ℳ is an L-structure and < is a total ordering of the domain of ℳ. ℳ is ordered minimal (-minimal) if and only if any parametrically definable X ⊆ ℳ can be represented as a finite union of points and intervals with endpoints in ℳ.In any ordered structure every finite union of points and intervals is definable. Thus the -minimal structures are the ones with no unnecessary definable sets. If T is a complete L-theory we say that T is strongly (-minimal if and only if every model of T is -minimal.The theory of real closed fields is the canonical example of a strongly -minimal theory. Strongly -minimal theories were introduced (in a less general guise which we discuss in §6) by van den Dries in [1]. Extending van den Dries' work, Pillay and Steinhorn (see [3], [4] and [2]) developed an extensive structure theory for definable sets in strongly -minimal theories, generalizing the results for real closed fields. They also established several striking analogies between strongly -minimal theories and ω-stable theories (most notably the existence and uniqueness of prime models). In this paper we will examine the construction of models of strongly -minimal theories emphasizing the problems involved in realizing and omitting types. Among other things we will prove that the Hanf number for omitting types for a strongly -minimal theory T is at most (2∣T∣)+, and characterize the strongly -minimal theories with models order isomorphic to (R, <).

Model theory under the axiom of determinateness

We initiate the study of model theory in the absence of the Axiom of Choice, using the Axiom of Determinateness as a powerful substitute. We first show that, in this context, is no more powerful than first-order logic. The emphasis then turns to upward Löwenhein-Skolem theorems; ℵ1 is the Hanf number of first-order logic, of , and of a strong fragment of , The main technical innovation is the development of iterated ultrapowers using infinite supports; this requires an application of infinite-exponent partition relations. All our theorems can be proven from hypotheses weaker than AD.