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)

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 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 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)

In this paper, we study the notions related to tree property 1 , or, equivalently, SOP2. Among others, we supply a type-counting criterion for TP1 and show the equivalence of TP1 and k- TP1. Then we introduce the notions of weak k- TP1 for k≥2, and also supply type-counting criteria for those. We do not know whether weak k- TP1 implies TP1, but at least we prove that each weak k- TP1 implies SOP1. Our generalization of the tree-indiscernibility results in (...) Džamonja and Shelah [5] is crucially used throughout the paper. (shrink)

This paper is devoted to understand groups definable in Presburger Arithmetic. We prove the following theorems: Theorem 1. Every group definable in a model of Presburger Arithmetic is abelian-by-finite. Theorem 2. Every bounded abelian group definable in a model of (Z, +, <) Presburger Arithmetic is definably isomorphic to (Z, +)^n mod out by a lattice.

We prove that in a rosy theory, the n-uniqueness of a strong type p implies the strong n-uniqueness of p. In addition we study some of the boundary properties of p.

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)

We prove that if T is a complete theory with weak elimination of imaginaries, then there is an explicit bijection between strict independence relations for T and strict independence relations for Teq\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${T^{\rm eq}}$$\end{document}. We use this observation to show that if T is the theory of the Fraïssé limit of finite metric spaces with integer distances, then Teq\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${T^{\rm eq}}$$\end{document} has more than one (...) strict independence relation. This answers a question of Adler :1–20, 2009, Question 1.7). (shrink)

We construct a fibered dimension function in some topological differential fields.

A structure M is pregeometric if the algebraic closure is a pregeometry in all structures elementarily equivalent to M. We define a generalisation: structures with an existential matroid. The main examples are superstable groups of Lascar U-rank a power of ω and d-minimal expansion of fields. Ultraproducts of pregeometric structures expanding an integral domain, while not pregeometric in general, do have a unique existential matroid. Generalising previous results by van den Dries, we define dense elementary pairs of structures expanding an (...) integral domain and with an existential matroid, and we show that the corresponding theories have natural completions, whose models also have a unique existential matroid. We also extend the above result to dense tuples of structures. (shrink)