As a continuation of ideas initiated in [19], we study bi-colored (generic) expansions of geometric theories in the style of the Fraïssé–Hrushovski construction method. Here we examine that the properties $NTP_{2}$, strongness, $NSOP_{1}$, and simplicity can be transferred to the expansions. As a consequence, while the corresponding bi-colored expansion of a red non-principal ultraproduct of p-adic fields is $NTP_{2}$, the expansion of algebraically closed fields with generic automorphism is a simple theory. Furthermore, these theories are strong with $\operatorname {\mathrm {bdn}}(\text (...) {"}x=x\text {"})=(\aleph _0)_{-}$. (shrink)

A linear space is a system of points and lines such that any two distinct points determine a unique line; a Steiner k-system is a linear space such that each line has size exactly k. Clearly, as a two-sorted structure, no linear space can be strongly minimal. We formulate linear spaces in a vocabulary $\tau $ with a single ternary relation R. We prove that for every integer k there exist $2^{\aleph _0}$ -many integer valued functions $\mu $ such that (...) each $\mu $ determines a distinct strongly minimal Steiner k-system $\mathcal {G}_\mu $, whose algebraic closure geometry has all the properties of the ab initio Hrushovski construction. Thus each is a counterexample to the Zilber Trichotomy Conjecture. (shrink)

Continuing work of Baldwin and Shi 1), we study non-ω-saturated generic structures of the ab initio Hrushovski construction with amalgamation over closed sets. We show that they are CM-trivial with weak elimination of imaginaries. Our main tool is a new characterization of non-forking in these theories.

We show that if a class K of finite relational structures is closed under quasi-substructures, then there is no saturated K-generic structure that is superstable but not ω -stable.

Given a sequence {a n } in (0,1) converging to a rational, we examine the model theoretic properties of structures obtained as limits of Shelah-Spencer graphs G(m, m -αn ). We show that in most cases the model theory is either extremely well-behaved or extremely wild, and characterize when each occurs.

A study of smooth classes whose generic structures have simple theory is carried out in a spirit similar to Hrushovski 147; Simplicity and the Lascar group, preprint, 1997) and Baldwin–Shi 1). We attach to a smooth class K0, of finite -structures a canonical inductive theory TNat, in an extension-by-definition of the language . Here TNat and the class of existentially closed models of =T+,EX, play an important role in description of the theory of the K0,-generic. We show that if M (...) is the K0,-generic then MEX. Furthermore, if this class is an elementary class then Th=Th). The investigations by Hrushovski and Pillay , provide a general theory for forking and simplicity for the nonelementary classes, and using these ideas, we show that if K0,, where {,*}, has the joint embedding property and is closed under the Independence Theorem Diagram then EX is simple. Moreover, we study cases where EX is an elementary class. We introduce the notion of semigenericity and show that if a K0,-semigeneric structure exists then EX is an elementary class and therefore the -theory of K0,-generic is near model complete. By this result we are able to give a new proof for a theorem of Baldwin and Shelah 1359). We conclude this paper by giving an example of a generic structure whose first-order theory is simple. (shrink)

We construct an ab initio generic structure for a predimension function with a positive rational coefficient less than or equal to 1 which is unsaturated and has a superstable non-ω-stable theory.

We study smooth classes without the algebraic closure property. For such smooth classes we investigate the simplicity of the class of generic structures, in the context of Robinson theories.

An infinite structure is said to be minimal if each of its definable subset is finite or cofinite. Modifying Hrushovski's method we construct minimal, non strongly minimal structures with arbitrary finite dimensions. This answers negatively to a problem posed by B. I Zilber.

This paper ties together much of the model theory of the last 50 years. Shelah's attempts to generalize the Morley theorem beyond first order logic led to the notion of excellence, which is a key to the structure theory of uncountable models. The notion of Abstract Elementary Class arose naturally in attempting to prove the categoricity theorem for L ω 1 ,ω (Q). More recently, Zilber has attempted to identify canonical mathematical structures as those whose theory (in an appropriate logic) (...) is categorical in all powers. Zilber's trichotomy conjecture for first order categorical structures was refuted by Hrushovski, by the introducion of a special kind of Abstract Elementary Class. Zilber uses a powerful and essentailly infinitary variant on these techniques to investigate complex exponentiation. This not only demonstrates the relevance of Shelah's model theoretic investigations to mainstream mathematics but produces new results and conjectures in algebraic geometry. (shrink)

We provide a general framework for studying the expansion of strongly minimal sets by adding additional relations in the style of Hrushovski. We introduce a notion of separation of quantifiers which is a condition on the class of expansions of finitely generated models for the expanded theory to have a countable ω-saturated model. We apply these results to construct for each sufficiently fast growing finite-to-one function μ from 'primitive extensions' to the natural numbers a theory T μ of an expansion (...) of an algebraically closed field which has Morley rank 2. Finally, we show that if μ is not finite-to-one the theory may not be ω-stable. (shrink)

In this paper, we prove the following:Theorem. Let M be a rosy dependent theory and letp,pbe non-þ-forking extensions ofp∈Switha0a1; assume thatp∪pis consistent and thata0,a1start a þ-independent indiscernible sequence. Thenp∪pis a non-þ-forking extension ofp.We also provide an example to show that the result is not true without assuming NIP.

Let L be a countable relational language. Baldwin asked whether there is an ab initio generic L-structure which is superstable but not ω-stable. We give a positive answer to his question, and prove that there is no ab initio generic L-structure which is superstable but not ω-stable, if L is finite and the generic is saturated.

We give an axiomatic framework for the non-modular simple 0-categorical structures constructed by Hrushovski. This allows us to verify some of their properties in a uniform way, and to show that these properties are preserved by iterations of the construction.

Model theory is concerned mainly, although not exclusively, with infinite structures. In recent years, finite structures have risen to greater prominence, both within the context of mainstream model theory, e.g., in work of Lachlan, Cherlin, Hrushovski, and others, and with the advent of finite model theory, which incorporates elements of classical model theory, combinatorics, and complexity theory. The purpose of this survey is to provide an overview of what might be called the model theory of finite structures. Some topics in (...) finite model theory have strong connections to theoretical computer science, especially descriptive complexity theory. In fact, it has been suggested that finite model theory really is, or should be, logic for computer science. These connections with computer science will, however, not be treated here.It is well-known that many classical results of ‘infinite model theory’ fail over the class of finite structures, including the compactness and completeness theorems, as well as many preservation and interpolation theorems. The failure of compactness in the finite, in particular, means that the standard proofs of many theorems are no longer valid in this context. At present, there is no known example of a classical theorem that remains true over finite structures, yet must be proved by substantially different methods. It is generally concluded that first-order logic is ‘badly behaved’ over finite structures.From the perspective of expressive power, first-order logic also behaves badly: it is both too weak and too strong. Too weak because many natural properties, such as the size of a structure being even or a graph being connected, cannot be defined by a single sentence. Too strong, because every class of finite structures with a finite signature can be defined by an infinite set of sentences. Even worse, every finite structure is defined up to isomorphism by a single sentence. In fact, it is perhaps because of this last point more than anything else that model theorists have not been very interested in finite structures. Modern model theory is concerned largely with complete first-order theories, which are completely trivial here. (shrink)

Hrushovski constructed an -categorical stable pseudoplane which refuted Lachlan's conjecture. In this note, we show that an -categorical projective plane cannot be constructed by "the Hrushovski method.".

In a relational language consisting of a single relation R, we investigate pseudofiniteness of certain Hrushovski constructions obtained via predimension functions. It is notable that the arity of the relation R plays a crucial role in this context. When R is ternary, by extending the methods recently developed by Brody and Laskowski, we interpret 〈Q+,<〉 in the 〈K+,≤∗〉-generic and prove that this structure is not pseudofinite. This provides a negative answer to the question posed in an earlier work by Evans (...) and Wong. This result, in fact, unfolds another aspect of complexity of this structure, along with undecidability and the strict order property proved in the mentioned earlier works. On the other hand, when R is binary, it can be shown that the 〈K+,≤∗〉-generic is decidable and pseudofinite. (shrink)

Let L be a finite relational language and α=(αR:R ∈ L) a tuple with 0 < αR ≤1 for each R ∈ L. Consider a dimension function $ \delta _\alpha (A) = \left| A \right| - \sum\limits_{R \in L} {\alpha {\mathop{\rm Re}\nolimits} R(A)} $ where each eR(A) is the number of realizations of R in A. Let $K_\alpha $ be the class of finite structures A such that $\delta _\alpha (X) \ge 0$ 0 for any substructure X of A. We (...) show that the theory of the generic model of $K_\alpha $ is AE-axiomatizable for any α. (shrink)

Let \ be an ab initio amalgamation class with an unbounded increasing concave function f. We show that if the predimension function has a rational coefficient and f satisfies a certain assumption then the generic structure of \ has a model complete theory.

The projective plane of Baldwin 695) is model complete in a language with additional constant symbols. The infinite rank bicolored field of Poizat 1339) is not model complete. The finite rank bicolored fields of Baldwin and Holland 371; Notre Dame J. Formal Logic , to appear) are model complete. More generally, the finite rank expansions of a strongly minimal set obtained by adding a ‘random’ unary predicate are almost strongly minimal and model complete provided the strongly minimal set is ‘well-behaved’ (...) and admits ‘exactly rank k formulas’. The last notion is a geometric condition on strongly minimal sets formalized in this paper. (shrink)

We prove that for any simple theory which is constructed via Fräissé-Hrushovski method, if the forking independence is the same as the d-independence then the stable forking property holds.

For $n < \omega$ , expand the structure (n, S, I, F) (with S the successor relation, I, F as the initial and final element) by forming graphs with edge probability n-α for irrational α, with $0 < \alpha < 1$ . The sentences in the expanded language, which have limit probability 1, form a complete and stable theory.

We show that the quantifier elimination result for the Shelah-Spencer almost sure theories of sparse random graphs $$G(n,n^{-\alpha })$$ given by Laskowski (Isr J Math 161:157–186, 2007) extends to their various analogues. The analogues will be obtained as theories of generic structures of certain classes of finite structures with a notion of strong substructure induced by rank functions and we will call the generics Baldwin–Shi hypergraphs. In the process we give a method of constructing extensions whose ‘relative rank’ is negative (...) but arbitrarily small in context. We give a necessary and sufficient condition for the theory of a Baldwin–Shi hypergraph to have atomic models. We further show that for certain well behaved classes of theories of Baldwin–Shi hypergraphs, the existentially closed models and the atomic models correspond. (shrink)

We investigate the isomorphism types of combinatorial geometries arising from Hrushovski's flat strongly minimal structures and answer some questions from Hrushovski's original paper.

An intermediate stage in Hrushovski’s construction of flat strongly minimal structures in a relational language L produces ω-stable structures of rank ω. We analyze the pregeometries given by forking on the regular type of rank ω in these structures. We show that varying L can affect the isomorphism type of the pregeometry, but not its finite subpregeometries. A sequel will compare these to the pregeometries of the strongly minimal structures.

We define an evolving Shelah‐Spencer process as one by which a random graph grows, with at each time a new node incorporated and attached to each previous node with probability, where is fixed. We analyse the graphs that result from this process, including the infinite limit, in comparison to Shelah‐Spencer sparse random graphs discussed in [21] and throughout the model‐theoretic literature. The first order axiomatisation for classical Shelah‐Spencer graphs comprises a Generic Extension axiom scheme and a No Dense Subgraphs axiom (...) scheme. We show that in our context Generic Extension continues to hold. While No Dense Subgraphs fails, a weaker Few Rigid Subgraphs property holds. (shrink)

We describe the progress of model theory in the last half century from the standpoint of how finite model theory might develop.