Let T be a complete geometric theory and let $$T_P$$ T P be the theory of dense pairs of models of T. We show that if T is superrosy with "Equation missing"-rank 1 then $$T_P$$ T P is superrosy with "Equation missing"-rank at most $$\omega $$ ω.

We consider the question of when an expansion of a first-order topological structure has the property that every open set definable in the expansion is definable in the original structure. This question has been investigated by Dolich, Miller and Steinhorn in the setting of ordered structures as part of their work on the property of having o-minimal open core. We answer the question in a fairly general setting and provide conditions which in practice are often easy to check. We give (...) a further characterisation in the special case of an expansion by a generic predicate. (shrink)

We study the class of weakly locally modular geometric theories introduced in [4], a common generalization of the classes of linear SU-rank 1 and linear o-minimal theories. We find new conditions equivalent to weak local modularity: "weak one-basedness", absence of type definable "almost quasidesigns", and "generic linearity". Among other things, we show that weak one-basedness is closed under reducts. We also show that the lovely pair expansion of a non-trivial weakly one-based ω-categorical geometric theory interprets an infinite vector space over (...) a finite field. (shrink)

We characterize þ-independence in a variety of structures, focusing on the field of real numbers expanded by predicate defining a dense multiplicative subgroup, G, satisfying the Mann property and whose pth powers are of finite index in G. We also show such structures are super-rosy and eliminate imaginaries up to codes for small sets.

We study the theory of lovely pairs of geometric structures, in particular o-minimal structures. We use the pairs to isolate a class of geometric structures called weakly locally modular which generalizes the class of linear structures in the settings of SU-rank one theories and o-minimal theories. For o-minimal theories, we use the Peterzil–Starchenko trichotomy theorem to characterize for a sufficiently general point, the local geometry around it in terms of the thorn U-rank of its type inside a lovely pair.

The randomization of a complete first-order theory [Formula: see text] is the complete continuous theory [Formula: see text] with two sorts, a sort for random elements of models of [Formula: see text] and a sort for events in an underlying atomless probability space. We study independence relations and related ternary relations on the randomization of [Formula: see text]. We show that if [Formula: see text] has the exchange property and [Formula: see text], then [Formula: see text] has a strict independence (...) relation in the home sort, and hence is real rosy. In particular, if [Formula: see text] is o-minimal, then [Formula: see text] is real rosy. (shrink)

O-minimal structures have long been thought to occupy the base of a hierarchy of ordered structures, in analogy with the role that strongly minimal structures play with respect to stable theories. This is the first in an anticipated series of papers whose aim is the development of model theory for ordered structures of rank greater than one. A class of ordered structures to which a notion of finite rank can be assigned, the decomposable structures, is introduced here. These include all (...) ordered structures definable in o-minimal structures. The principal result in this paper, Theorem 5.1, asserts roughly that a decomposable structure [Formula: see text] can be partitioned into finitely many definable subsets such that on each set the restriction of < is a "twisted lexicographic" order. As a consequence, for all n and linear orders ≺ definable on a subset X ⊆ Mn in an o-minimal structure [Formula: see text], there is a definable partition of X such that the restriction of ≺ to each set in the partition is "lexicographic". (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.

We examine fields in which model theoretic algebraic closure coincides with relative field theoretic algebraic closure. These are perfect fields with nice model theoretic behaviour. For example, they are exactly the fields in which algebraic independence is an abstract independence relation in the sense of Kim and Pillay. Classes of examples are perfect PAC fields, model complete large fields and henselian valued fields of characteristic 0.

We recover the essentials of þ-forking, rosiness and super-rosiness for certain amalgamation classes K, and thence of finite-variable theories of finite structures. This provides a foundation for a model-theoretic analysis of a natural extension of the “LkLk-Canonization Problem” – the possibility of efficiently recovering finite models of T given a finite presentation of an LkLk-theory T. Some of this work is accomplished through different sorts of “transfer” theorem to the first-order theory TlimTlim of the direct limit. Our results include, to (...) start with, a recovery of the basic technology of þ-independence [15]) using a rather straightforward transfer. We also recover an analog of the “þ-Independence theorems” of Ealy and Onshuus [7] for amalgamation classes and their limits by showing how to transfer/lift an abstract independence relation on the amalgamation class to the limit theory TlimTlim. We also work out an appropriate notion of Local Character for independence relations over classes finite structures, and we use this to verify that rosiness and super-rosiness-with-finite-UþUþ-ranks coincide in these amalgamation classes and their limit theories. (shrink)

We introduce the concept of o-asymptotic classes of finite structures, melding ideas coming from 1-dimensional asymptotic classes and o-minimality. Along with several examples and non-examples of these classes, we present some classification theory results of their infinite ultraproducts: Every infinite ultraproduct of structures in an o-asymptotic class is superrosy of U^þ-rank 1, and NTP2 (in fact, inp-minimal).

Let M be an arbitrary structure. Then we say that an M -formula φ defines a stable set inM if every formula φ ∧ α is stable. We prove: If G is an M -definable group and every definable stable subset of G has U -rank at most n , then G has a maximal connected stable normal subgroup H such that G /H is purely unstable. The assumptions hold for example if M is interpretable in an o-minimal structure.More generally, (...) an M -definable set X is weakly stable if the M -induced structure on X is stable. We observe that, by results of Shelah, every weakly stable set in theories with NIP is stable. (shrink)

We discuss the role of weakly normal formulas in the theory of thorn forking, as part of a commentary on the paper [5]. We also give a counterexample to Corollary 4.2 from that paper, and in the process discuss “theories with selectors.”.

We define a notion of residue field domination for valued fields which generalizes stable domination in algebraically closed valued fields. We prove that a real closed valued field is dominated by the sorts internal to the residue field, over the value group, both in the pure field and in the geometric sorts. These results characterize forking and þ-forking in real closed valued fields (and also algebraically closed valued fields). We lay some groundwork for extending these results to a power-bounded T-convex (...) theory. (shrink)

We develop a basic theory of rosy groups and we study groups of small Uþ-rank satisfying NIP and having finitely satisfiable generics: Uþ-rank 1 implies that the group is abelian-by-finite, Uþ-rank 2 implies that the group is solvable-by-finite, Uþ-rank 2, and not being nilpotent-by-finite implies the existence of an interpretable algebraically closed field.

A ternary relation [Formula: see text] between subsets of the big model of a complete first-order theory T is called an independence relation if it satisfies a certain set of axioms. The primary example is forking in a simple theory, but o-minimal theories are also known to have an interesting independence relation. Our approach in this paper is to treat independence relations as mathematical objects worth studying. The main application is a better understanding of thorn-forking, which turns out to be (...) closely related to modular pairs in the lattice of algebraically closed sets. (shrink)

A ternary relation [Formula: see text] between subsets of the big model of a complete first-order theory T is called an independence relation if it satisfies a certain set of axioms. The primary example is forking in a simple theory, but o-minimal theories are also known to have an interesting independence relation. Our approach in this paper is to treat independence relations as mathematical objects worth studying. The main application is a better understanding of thorn-forking, which turns out to be (...) closely related to modular pairs in the lattice of algebraically closed sets. (shrink)

We give some sufficient conditions for a predicate P in a complete theory T to be "stably embedded". Let P be P with its "induced θ-definable structure". The conditions are that P (or rather its theory) is "rosy", P has NIP in T and that P is stably 1-embedded in T. This generalizes a recent result of Hasson and Onshuus [6] which deals with the case where P is o-minimal in T. Our proofs make use of the theory of strict (...) nonforking and weight in NIP theories ([3], [10]). (shrink)