There is a Turing functional $\Phi $ taking $A^\prime $ to a theory $T_A$ whose complexity is exactly that of the jump of A, and which has the property that $A \leq _T B$ if and only if $T_A \trianglelefteq T_B$ in Keisler’s order. In fact, by more elaborate means and related theories, we may keep the complexity at the level of A without using the jump.

The main topic of this paper is the investigation of generalized amalgamation properties for simple theories. That is, we are trying to answer the question of when a simple theory has the property of n-dimensional amalgamation, where two-dimensional amalgamation is the Independence Theorem for simple theories. We develop the notions of strong n-simplicity and n-simplicity for 1≤n≤ω, where both “1-simple” and “strongly 1-simple” are the same as “simple”. For strong n-simplicity, we present examples of simple unstable theories in each subclass (...) and prove a characteristic property of strong n-simplicity in terms of strong n-dividing, a strengthening of the dependence relation called dividing in simple theories. We prove a strong three-dimensional amalgamation property for strongly 2-simple theories, and, under an additional assumption, a strong -dimensional amalgamation property for strongly n-simple theories. In the last section of the paper we comment on why strong n-simplicity is called strong. (shrink)

We study the problem of extending an abstract independence notion for types of singletons to longer types. Working in the framework of tame abstract elementary classes, we show that good frames can always be extended to types of independent sequences. As an application, we show that tameness and a good frame imply Shelah’s notion of dimension is well-behaved, complementing previous work of Jarden and Sitton. We also improve a result of the first author on extending a frame to larger models.

We present a new proof of the existence of Morley sequences in simple theories. We avoid using the Erdős–Rado theorem and instead use only Ramsey’s theorem and compactness. The proof shows that the basic theory of forking in simple theories can be developed using only principles from “ordinary mathematics,” answering a question of Grossberg, Iovino, and Lessmann, as well as a question of Baldwin.

We introduce the oak property of first order theories, which is a syntactical condition that we show to be sufficient for a theory not to have universal models in cardinality λ when certain cardinal arithmetic assumptions about λ implying the failure of GCH hold. We give two examples of theories that have the oak property and show that none of these examples satisfy SOP4, not even SOP3. This is related to the question of the connection of the property SOP4 to (...) non-universality, as was raised by the earlier work of Shelah. One of our examples is the theory for which non-universality results similar to the ones we obtain are already known; hence we may view our results as an abstraction of the known results from a concrete theory to a class of theories. We show that no theory with the oak property is simple. (shrink)

We discuss dividing lines (in model theory) and some test questions, mainly the universality spectrum. So there is much on conjectures, problems and old results, mainly of the author and also on some recent results.

Quasiminimal structures play an important role in non-elementary categoricity. In this paper we explore possibilities of constructing quasiminimal models of a given first-order theory. We present several constructions with increasing control of the properties of the outcome using increasingly stronger assumptions on the theory. We also establish an upper bound on the Hanf number of the existence of arbitrarily large quasiminimal models.