The main result of this article is sub-additivity of the dp-rank. We also show that the study of theories of finite dp-rank cannot be reduced to the study of its dp-minimal types, and we discuss the possible relations between dp-rank and VC-density.
The main result of this article is sub-additivity of the dp-rank. We also show that the study of theories of finite dp-rank can not be reduced to the study of …
The main result of this article is sub-additivity of the dp-rank. We also show that the study of theories of finite dp-rank can not be reduced to the study of its dp-minimal types, and discuss the possible relations between dp-rank and VC-density.
The main result of this article is sub-additivity of the dp-rank. We also show that the study of theories of finite dp-rank can not be reduced to the study of …
The main result of this article is sub-additivity of the dp-rank. We also show that the study of theories of finite dp-rank can not be reduced to the study of its dp-minimal types, and discuss the possible relations between dp-rank and VC-density.
Abstract This paper has two parts. In the first one, we prove that an invariant dp-minimal type is either finitely satisfiable or definable. We also prove that a definable version …
Abstract This paper has two parts. In the first one, we prove that an invariant dp-minimal type is either finitely satisfiable or definable. We also prove that a definable version of the (p,q)-theorem holds in dp-minimal theories of small or medium directionality. In the second part, we study dp-rank in dp-minimal theories and show that it enjoys many nice properties. It is continuous, definable in families and it can be characterised geometrically with no mention of indiscernible sequences. In particular, if the structure expands a divisible ordered abelian group, then dp-rank coincides with the dimension coming from the order.
We prove that in NTP_2 theories if p is a dependent type with dp-rank >= \kappa, then this can be witnessed by indiscernible sequences of tuples satisfying p. If p …
We prove that in NTP_2 theories if p is a dependent type with dp-rank >= \kappa, then this can be witnessed by indiscernible sequences of tuples satisfying p. If p has dp-rank infinity, then this can be witnessed by singletons (in any theory).
In this paper, we build a dimension theory related to Shelah's 2-rank, dp-rank, and o-minimal dimension. We call this dimension op-dimension. We exhibit the notion of the n-multi-order property, generalizing …
In this paper, we build a dimension theory related to Shelah's 2-rank, dp-rank, and o-minimal dimension. We call this dimension op-dimension. We exhibit the notion of the n-multi-order property, generalizing the order property, and use this to create op-rank, which generalizes 2-rank. From this we build op-dimension. We show that op-dimension bounds dp-rank, that op-dimension is sub-additive, and op-dimension generalizes o-minimal dimension in o-minimal theories.
In this paper, we build a dimension theory related to Shelah's 2-rank, dp-rank, and o-minimal dimension. We call this dimension op-dimension. We exhibit the notion of the n-multi-order property, generalizing …
In this paper, we build a dimension theory related to Shelah's 2-rank, dp-rank, and o-minimal dimension. We call this dimension op-dimension. We exhibit the notion of the n-multi-order property, generalizing the order property, and use this to create op-rank, which generalizes 2-rank. From this we build op-dimension. We show that op-dimension bounds dp-rank, that op-dimension is sub-additive, and op-dimension generalizes o-minimal dimension in o-minimal theories.
Building on Pierre Simon's notion of distality, we introduce distality rank as a property of first-order theories and give examples for each rank $m$ such that $1\leq m \leq \omega$. …
Building on Pierre Simon's notion of distality, we introduce distality rank as a property of first-order theories and give examples for each rank $m$ such that $1\leq m \leq \omega$. For NIP theories, we show that distality rank is invariant under base change. We also define a generalization of type orthogonality called $m$-determinacy and show that theories of distality rank $m$ require certain products to be $m$-determined. Furthermore, for NIP theories, this behavior characterizes $m$-distality. If we narrow the scope to stable theories, we observe that $m$-distality can be characterized by the maximum cycle size found in the forking "geometry," so it coincides with $(m-1)$-triviality. On a broader scale, we see that $m$-distality is a strengthening of Saharon Shelah's notion of $m$-dependence.
Building on Pierre Simon's notion of distality, we introduce distality rank as a property of first-order theories and give examples for each rank $m$ such that $1\leq m \leq \omega$. …
Building on Pierre Simon's notion of distality, we introduce distality rank as a property of first-order theories and give examples for each rank $m$ such that $1\leq m \leq \omega$. For NIP theories, we show that distality rank is invariant under base change. We also define a generalization of type orthogonality called $m$-determinacy and show that theories of distality rank $m$ require certain products to be $m$-determined. Furthermore, for NIP theories, this behavior characterizes $m$-distality. If we narrow the scope to stable theories, we observe that $m$-distality can be characterized by the maximum cycle size found in the forking geometry, so it coincides with $(m-1)$-triviality. On a broader scale, we see that $m$-distality is a strengthening of Saharon Shelah's notion of $m$-dependence.
For a countable, complete, first-order theory $T$, we study $At$, the class of atomic models of $T$. We develop an analogue of $U$-rank and prove two results. On one hand, …
For a countable, complete, first-order theory $T$, we study $At$, the class of atomic models of $T$. We develop an analogue of $U$-rank and prove two results. On one hand, if some tp(d/a) is not ranked, then there are $2^{\aleph_1}$ non-isomorphic models in $At$ of size $\aleph_1$. On the other hand, if all types have finite rank, then the rank is fully additive and every finite tuple is dominated by an independent set of realizations of pseudo-minimal types.
We study a class of first-order theories whose complete quantifier-free types with one free variable either have a trivial positive part or are isolated by a positive quantifier-free formula--plus a …
We study a class of first-order theories whose complete quantifier-free types with one free variable either have a trivial positive part or are isolated by a positive quantifier-free formula--plus a few other technical requirements. The theory of vector spaces and the theory fields are examples. We prove the amalgamation property and the existence of a model-companion. We show that the model-companion is strongly minimal. We also prove that the length of any increasing sequence of prime types is bounded, so every formula has finite Krull dimension.
We study a class of first-order theories whose complete quantifier-free types with one free variable either have a trivial positive part or are isolated by a positive quantifier-free formula---plus a …
We study a class of first-order theories whose complete quantifier-free types with one free variable either have a trivial positive part or are isolated by a positive quantifier-free formula---plus a few other technical requirements. The theory of vector spaces and the theory fields are examples. We prove the amalgamation property and the existence of a model-companion. We show that the model-companion is strongly minimal. We also prove that the length of any increasing sequence of prime types is bounded, so every formula has finite Krull dimension.
In this paper, we study VC-minimal theories and explore related concepts. We first define the notion of convex orderablility and show that this lies strictly between VC-minimality and dp-minimality. Next, …
In this paper, we study VC-minimal theories and explore related concepts. We first define the notion of convex orderablility and show that this lies strictly between VC-minimality and dp-minimality. Next, we define the notion of weak VC-minimality, show it lies strictly between VC-minimality and dependence, and show that all unstable weakly VC-minimal theories interpret an infinite linear order. Finally, we define the notion full VC-minimality, show that this lies strictly between weak o-minimality and VC-minimality, and show that theories that are fully VC-minimal have low VC-density.
In this paper, we study VC-minimal theories and explore related concepts. We first define the notion of convex orderablility and show that this lies strictly between VC-minimality and dp-minimality. Next, …
In this paper, we study VC-minimal theories and explore related concepts. We first define the notion of convex orderablility and show that this lies strictly between VC-minimality and dp-minimality. Next, we define the notion of weak VC-minimality, show it lies strictly between VC-minimality and dependence, and show that all unstable weakly VC-minimal theories interpret an infinite linear order. Finally, we define the notion full VC-minimality, show that this lies strictly between weak o-minimality and VC-minimality, and show that theories that are fully VC-minimal have low VC-density.
Abstract Building on Pierre Simon’s notion of distality, we introduce distality rank as a property of first-order theories and give examples for each rank m such that $1\leq m \leq …
Abstract Building on Pierre Simon’s notion of distality, we introduce distality rank as a property of first-order theories and give examples for each rank m such that $1\leq m \leq \omega $ . For NIP theories, we show that distality rank is invariant under base change. We also define a generalization of type orthogonality called m -determinacy and show that theories of distality rank m require certain products to be m -determined. Furthermore, for NIP theories, this behavior characterizes m -distality. If we narrow the scope to stable theories, we observe that m -distality can be characterized by the maximum cycle size found in the forking “geometry,” so it coincides with $(m-1)$ -triviality. On a broader scale, we see that m -distality is a strengthening of Saharon Shelah’s notion of m -dependence.
In this paper, we introduce the notion of K-rank, where K is an strong amalgamation Fraisse class. Roughly speaking, the K-rank of a partial type is the number of "copies" …
In this paper, we introduce the notion of K-rank, where K is an strong amalgamation Fraisse class. Roughly speaking, the K-rank of a partial type is the number of "copies" of K that can be "independently coded" inside of the type. We study K-rank for specific examples of K, including linear orders, equivalence relations, and graphs. We discuss the relationship of K-rank to other ranks in model theory, including dp-rank and op-dimension (a notion coined by the first author and C. D. Hill in previous work).
We investigate the question of whether the restriction of a NIP type $p\in S(B)$ which does not fork over $A\subseteq B$ to $A$ is also NIP, and the analogous question …
We investigate the question of whether the restriction of a NIP type $p\in S(B)$ which does not fork over $A\subseteq B$ to $A$ is also NIP, and the analogous question for dp-rank. We show that if $B$ contains a Morley sequence $I$ generated by $p$ over $A$, then $p\restriction AI$ is NIP and similarly preserves the dp-rank. This yields positive answers for generically stable NIP types and the analogous case of stable types. With similar techniques we also provide a new more direct proof for the latter. Moreover, we introduce a general construction of "trees whose open cones are models of some theory" and in particular an inp-minimal theory DTR of dense trees with random graphs on open cones, which exemplifies a negative answer to the question.
Title of dissertation: ON DEFINABILITY OF TYPES IN DEPENDENT THEORIES Vincent Guingona, Doctor of Philosophy, 2011 Dissertation directed by: Professor Michael Chris Laskowski Department of Mathematics Using definability of types …
Title of dissertation: ON DEFINABILITY OF TYPES IN DEPENDENT THEORIES Vincent Guingona, Doctor of Philosophy, 2011 Dissertation directed by: Professor Michael Chris Laskowski Department of Mathematics Using definability of types for stable formulas, one develops the powerful tools of stability theory, such as canonical bases, a nice forking calculus, and stable embeddability. When one passes to the class of dependent formulas, this notion of definability of types is lost. However, as this dissertation shows, we can recover suitable alternatives to definability of types for some dependent theories. Using these alternatives, we can recover some of the power of stability theory. One alternative is uniform definability of types over finite sets (UDTFS). We show that all formulas in dp-minimal theories have UDTFS, as well as formulas with VC-density < 2. We also show that certain Henselian valued fields have UDTFS. Another alternative is isolated extensions. We show that dependent formulas are characterized by the existence of isolated extensions, and show how this gives a weak stable embeddability result. We also explore the idea of UDTFS rank and show how it relates to VC-density. Finally, we use the machinery developed in this dissertation to show that VCminimal theories satisfy the Kueker Conjecture. ON DEFINABILITY OF TYPES IN DEPENDENT THEORIES
We show that any formula with two free variables in a VC-minimal theory has VC-codensity at most two. Modifying the argument slightly, we give a new proof of the fact …
We show that any formula with two free variables in a VC-minimal theory has VC-codensity at most two. Modifying the argument slightly, we give a new proof of the fact that, in a VC-minimal theory where acl = dcl, the VC-codensity of a formula is at most the number of free variables.
We recast the problem of calculating Vapnik-Chervonenkis (VC) density into one of counting types, and thereby calculate bounds (often optimal) on the VC density for some weakly o-minimal, weakly quasi-o-minimal, …
We recast the problem of calculating Vapnik-Chervonenkis (VC) density into one of counting types, and thereby calculate bounds (often optimal) on the VC density for some weakly o-minimal, weakly quasi-o-minimal, and <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper P"> <mml:semantics> <mml:mi>P</mml:mi> <mml:annotation encoding="application/x-tex">P</mml:annotation> </mml:semantics> </mml:math> </inline-formula>-minimal theories.
Abstract We establish several results regarding dividing and forking in NTP 2 theories. We show that dividing is the same as array-dividing. Combining it with existence of strictly invariant sequences …
Abstract We establish several results regarding dividing and forking in NTP 2 theories. We show that dividing is the same as array-dividing. Combining it with existence of strictly invariant sequences we deduce that forking satisfies the chain condition over extension bases (namely, the forking ideal is S1, in Hrushovski’s terminology). Using it we prove an independence theorem over extension bases (which, in the case of simple theories, specializes to the ordinary independence theorem). As an application we show that Lascar strong type and compact strong type coincide over extension bases in an NTP 2 theory. We also define the dividing order of a theory—a generalization of Poizat’s fundamental order from stable theories—and give some equivalent characterizations under the assumption of NTP 2 . The last section is devoted to a refinement of the class of strong theories and its place in the classification hierarchy.
We develop some tools for analyzing dp-finite fields, including a notion of an ``inflator'' which generalizes the notion of a valuation/specialization on a field. For any field $K$, let $\operatorname{Sub}_K(K^n)$ …
We develop some tools for analyzing dp-finite fields, including a notion of an ``inflator'' which generalizes the notion of a valuation/specialization on a field. For any field $K$, let $\operatorname{Sub}_K(K^n)$ denote the lattice of $K$-linear subspaces of $K^n$. An ordinary valuation on $K$ with residue field $k$ induces order-preserving dimension-preserving specialization maps from $\operatorname{Sub}_K(K^n)$ to $\operatorname{Sub}_k(k^n)$, satisfying certain compatibility across $n$. An $r$-inflator is a similar family of maps $\{\operatorname{Sub}_K(K^n) \to \operatorname{Sub}_k(k^{rn})\}_{n \in \mathbb{N}}$ scaling dimensions by $r$. We show that 1-inflators are equivalent to valuations, and that $r$-inflators naturally arise in fields of dp-rank $r$. This machinery was ``behind the scenes'' in §10 of [10]. We rework §10 of [10] using the machinery of $r$-inflators.
A theorem of Elekes and Szabó recognizes algebraic groups among certain complex algebraic varieties with maximal size intersections with finite grids. We establish a generalization to relations of any arity …
A theorem of Elekes and Szabó recognizes algebraic groups among certain complex algebraic varieties with maximal size intersections with finite grids. We establish a generalization to relations of any arity and dimension definable in: (1) stable structures with distal expansions (includes algebraically and differentially closed fields of characteristic 0) and (2) o-minimal expansions of groups. Our methods provide explicit bounds on the power-saving exponent in the nongroup case. Ingredients of the proof include a higher arity generalization of the abelian group configuration theorem in stable structures (along with a purely combinatorial variant characterizing Latin hypercubes that arise from abelian groups) and Zarankiewicz-style bounds for hypergraphs definable in distal structures.
Let $\mathcal M=\langle K;O\rangle$ be a real closed valued field and let $k$ be its residue field. We prove that every interpretable field in $\mathcal M$ is definably isomorphic to …
Let $\mathcal M=\langle K;O\rangle$ be a real closed valued field and let $k$ be its residue field. We prove that every interpretable field in $\mathcal M$ is definably isomorphic to either $K$, $K(\sqrt{-1})$, $k$, or $k(\sqrt{-1})$. The same result holds when $K$ is a model of $T$, for $T$ an o-minimal power bounded expansion of a real closed field, and $O$ is a $T$-convex subring. The proof is direct and does not make use of known results about elimination of imaginaries in valued fields.
We consider existentially closed fields with several orderings, valuations, and [Formula: see text]-valuations. We show that these structures are NTP 2 of finite burden, but usually have the independence property. …
We consider existentially closed fields with several orderings, valuations, and [Formula: see text]-valuations. We show that these structures are NTP 2 of finite burden, but usually have the independence property. Moreover, forking agrees with dividing, and forking can be characterized in terms of forking in ACVF, RCF, and [Formula: see text]CF.
We construct a nontrivial definable type V field topology on any dp-minimal field [Formula: see text] that is not strongly minimal, and prove that definable subsets of [Formula: see text] …
We construct a nontrivial definable type V field topology on any dp-minimal field [Formula: see text] that is not strongly minimal, and prove that definable subsets of [Formula: see text] have small boundary. Using this topology and its properties, we show that in any dp-minimal field [Formula: see text], dp-rank of definable sets varies definably in families, dp-rank of complete types is characterized in terms of algebraic closure, and [Formula: see text] is finite for all [Formula: see text]. Additionally, by combining the existence of the topology with results of Jahnke, Simon and Walsberg [Dp-minimal valued fields, J. Symbolic Logic 82(1) (2017) 151–165], it follows that dp-minimal fields that are neither algebraically closed nor real closed admit nontrivial definable Henselian valuations. These results are a key stepping stone toward the classification of dp-minimal fields in [Fun with fields, Ph.D. thesis, University of California, Berkeley (2016)].
Let $K$ be an elementary extension of $\mathbb{Q}_p$, $V$ be the set of finite $a \in K$, $\mathrm{st}$ be the standard part map $K^m \to \mathbb{Q}^m_p$, and $X \subseteq K^m$ …
Let $K$ be an elementary extension of $\mathbb{Q}_p$, $V$ be the set of finite $a \in K$, $\mathrm{st}$ be the standard part map $K^m \to \mathbb{Q}^m_p$, and $X \subseteq K^m$ be $K$-definable. Delon has shown that $\mathbb{Q}^m_p \cap X$ is $\mathbb{Q}_p$-definable. Yao has shown that $\dim \mathbb{Q}^m_p \cap X \leq \dim X$ and $\dim \mathrm{st}(V^n \cap X) \leq \dim X$. We give new $\mathrm{NIP}$-theoretic proofs of these results and show that both inequalities hold in much more general settings. We also prove the analogous results for the expansion $\mathbb{Q}^{\mathrm{an}}_p$ of $\mathbb{Q}_p$ by all analytic functions $\mathbb{Z}^n_p \to \mathbb{Q}_p$. As an application we show that if $(X_k)_{k \in \mathbb{N}}$ is a sequence of elements of an $\mathbb{Q}^{\mathrm{an}}_p$-definable family of subsets of $\mathbb{Q}^m_p$ which converges in the Hausdroff topology to $X \subseteq \mathbb{Q}^m_p$ then $X$ is $\mathbb{Q}^{\mathrm{an}}_p$-definable and $\dim X \leq \limsup_{k \to \infty} \dim X_k$.
Title of dissertation: ON DEFINABILITY OF TYPES IN DEPENDENT THEORIES Vincent Guingona, Doctor of Philosophy, 2011 Dissertation directed by: Professor Michael Chris Laskowski Department of Mathematics Using definability of types …
Title of dissertation: ON DEFINABILITY OF TYPES IN DEPENDENT THEORIES Vincent Guingona, Doctor of Philosophy, 2011 Dissertation directed by: Professor Michael Chris Laskowski Department of Mathematics Using definability of types for stable formulas, one develops the powerful tools of stability theory, such as canonical bases, a nice forking calculus, and stable embeddability. When one passes to the class of dependent formulas, this notion of definability of types is lost. However, as this dissertation shows, we can recover suitable alternatives to definability of types for some dependent theories. Using these alternatives, we can recover some of the power of stability theory. One alternative is uniform definability of types over finite sets (UDTFS). We show that all formulas in dp-minimal theories have UDTFS, as well as formulas with VC-density < 2. We also show that certain Henselian valued fields have UDTFS. Another alternative is isolated extensions. We show that dependent formulas are characterized by the existence of isolated extensions, and show how this gives a weak stable embeddability result. We also explore the idea of UDTFS rank and show how it relates to VC-density. Finally, we use the machinery developed in this dissertation to show that VCminimal theories satisfy the Kueker Conjecture. ON DEFINABILITY OF TYPES IN DEPENDENT THEORIES
We consider existentially closed fields with several orderings, valuations, and $p$-valuations. We show that these structures are NTP$_2$ of finite burden, but usually have the independence property. Moreover, forking agrees …
We consider existentially closed fields with several orderings, valuations, and $p$-valuations. We show that these structures are NTP$_2$ of finite burden, but usually have the independence property. Moreover, forking agrees with dividing, and forking can be characterized in terms of forking in ACVF, RCF, and $p$CF.
This paper presents some finite combinatorics of set systems with applications to model theory, particularly the study of dependent theories. There are two main results. First, we give a way …
This paper presents some finite combinatorics of set systems with applications to model theory, particularly the study of dependent theories. There are two main results. First, we give a way of producing lower bounds on VCind-density and use it to compute the exact VCind-density of polynomial inequalities and a variety of geometric set families. The main technical tool used is the notion of a maximum set system, which we juxtapose to indiscernibles. In the second part of the paper we give a maximum set system analogue to Shelah’s characterization of stability using indiscernible sequences.
We investigate the notions of strict independence and strict non-forking, and establish basic properties and connections between the two. In particular, it follows from our investigation that in resilient theories …
We investigate the notions of strict independence and strict non-forking, and establish basic properties and connections between the two. In particular, it follows from our investigation that in resilient theories strict non-forking is symmetric. Based on this study, we develop notions of weight which characterize NTP 2 , dependence and strong dependence. Many of our proofs rely on careful analysis of sequences that witness dividing. We prove simple characterizations of such sequences in resilient theories, as well as of Morley sequences which are witnesses. As a by-product we obtain information on types co-dominated by generically stable types in dependent theories. For example, we prove that every Morley sequence in such a type is a witness.
We establish several results regarding dividing and forking in NTP2 theories. We show that dividing is the same as array-dividing. Combining it with existence of strictly invariant sequences we deduce …
We establish several results regarding dividing and forking in NTP2 theories. We show that dividing is the same as array-dividing. Combining it with existence of strictly invariant sequences we deduce that forking satisfies the chain condition over extension bases (namely, the forking ideal is S1, in Hrushovski's terminology). Using it we prove an independence theorem over extension bases (which, in the case of simple theories, specializes to the ordinary independence theorem). As an application we show that Lascar strong type and compact strong type coincide over extension bases in an NTP2 theory. We also define the dividing order of a theory -- a generalization of Poizat's fundamental order from stable theories -- and give some equivalent characterizations under the assumption of NTP2. The last section is devoted to a refinement of the class of strong theories and its place in the classification hierarchy.
We prove that an expansion of an algebraically closed field by $n$ arbitrary valuation rings is NTP${}_2$, and in fact has finite burden. It fails to be NIP, however, unless …
We prove that an expansion of an algebraically closed field by $n$ arbitrary valuation rings is NTP${}_2$, and in fact has finite burden. It fails to be NIP, however, unless the valuation rings form a chain. Moreover, the incomplete theory of algebraically closed fields with $n$ valuation rings is decidable.
Abstract This paper has two parts. In the first one, we prove that an invariant dp-minimal type is either finitely satisfiable or definable. We also prove that a definable version …
Abstract This paper has two parts. In the first one, we prove that an invariant dp-minimal type is either finitely satisfiable or definable. We also prove that a definable version of the (p,q)-theorem holds in dp-minimal theories of small or medium directionality. In the second part, we study dp-rank in dp-minimal theories and show that it enjoys many nice properties. It is continuous, definable in families and it can be characterised geometrically with no mention of indiscernible sequences. In particular, if the structure expands a divisible ordered abelian group, then dp-rank coincides with the dimension coming from the order.
Abstract We study the structure of infinite discrete sets D definable in expansions of ordered Abelian groups whose theories are strong and definably complete, with a particular emphasis on the …
Abstract We study the structure of infinite discrete sets D definable in expansions of ordered Abelian groups whose theories are strong and definably complete, with a particular emphasis on the set $D'$ comprised of differences between successive elements. In particular, if the burden of the structure is at most n , then the result of applying the operation $D \mapsto D'\ n$ times must be a finite set (Theorem 1.1). In the case when the structure is densely ordered and has burden $2$ , we show that any definable unary discrete set must be definable in some elementary extension of the structure $\langle \mathbb{R}; <, +, \mathbb{Z} \rangle $ (Theorem 1.3).
We investigate a model theoretic invariant $\kappa_{srd}^m(T)$, which was introduced by Shelah in his famous book, and prove that $\kappa_{srd}^m(T)$ is sub-additive. When $\kappa_{srd}^m(T)$ is infinite, this gives the equality …
We investigate a model theoretic invariant $\kappa_{srd}^m(T)$, which was introduced by Shelah in his famous book, and prove that $\kappa_{srd}^m(T)$ is sub-additive. When $\kappa_{srd}^m(T)$ is infinite, this gives the equality $\kappa^m_{srd}(T)=\kappa^1_{srd}(T)$, answering a question by Shelah. We apply the same proof method to analyze another invariant $\kappa^m_{ird}(T)$, and show that it is also sub-additive, improving a result in the book.
In this paper, we introduce the notion of K-rank, where K is an algebraically trivial Fraisse class. Roughly speaking, the K-rank of a partial type is the number of copies …
In this paper, we introduce the notion of K-rank, where K is an algebraically trivial Fraisse class. Roughly speaking, the K-rank of a partial type is the number of copies of K that can be independently coded inside of the type. We study K-rank for specific examples of K, including linear orders, equivalence relations, and graphs. We discuss the relationship of K-rank to other ranks in model theory, including dp-rank and op-dimension (a notion coined by the first author and C. D. Hill in previous work).
In this paper, we introduce the notion of K-rank, where K is an algebraically trivial Fraisse class. Roughly speaking, the K-rank of a partial type is the number of independent …
In this paper, we introduce the notion of K-rank, where K is an algebraically trivial Fraisse class. Roughly speaking, the K-rank of a partial type is the number of independent copies of K that can be coded inside of the type. We study K-rank for specific examples of K, including linear orders, equivalence relations, and graphs. We discuss the relationship of K-rank to other well-studied ranks in model theory, including dp-rank and op-dimension.
We consider profinite groups as 2-sorted first order structures, with a group sort, and a second sort which acts as an index set for a uniformly definable basis of neighbourhoods …
We consider profinite groups as 2-sorted first order structures, with a group sort, and a second sort which acts as an index set for a uniformly definable basis of neighbourhoods of the identity. It is shown that if the basis consists of {\em all} open subgroups, then the first order theory of such a structure is NIP (that is, does not have the independence property) precisely if the group has a normal subgroup of finite index which is a direct product of finitely many compact $p$-adic analytic groups, for distinct primes $p$. In fact, the condition NIP can here be weakened to NTP${}_2$. We also show that any NIP profinite group, presented as a 2-sorted structure, has an open prosoluble normal subgroup.
We initiate a systematic study of the class of theories without the tree property of the second kind - NTP2. Most importantly, we show: the burden is sub-multiplicative in arbitrary …
We initiate a systematic study of the class of theories without the tree property of the second kind - NTP2. Most importantly, we show: the burden is sub-multiplicative in arbitrary theories (in particular, if a theory has TP2 then there is a formula with a single variable witnessing this); NTP2 is equivalent to the generalized Kim's lemma and to the boundedness of ist-weight; the dp-rank of a type in an arbitrary theory is witnessed by mutually indiscernible sequences of realizations of the type, after adding some parameters - so the dp-rank of a 1-type in any theory is always witnessed by sequences of singletons; in NTP2 theories, simple types are co-simple, characterized by the co-independence theorem, and forking between the realizations of a simple type and arbitrary elements satisfies full symmetry; a Henselian valued field of characteristic (0,0) is NTP2 (strong, of finite burden) if and only if the residue field is NTP2 (the residue field and the value group are strong, of finite burden respectively), so in particular any ultraproduct of p-adics is NTP2; adding a generic predicate to a geometric NTP2 theory preserves NTP2.
Abstract An equation to compute the dp-rank of any abelian group is given. It is also shown that its dp-rank, or more generally that of any one-based group, agrees with …
Abstract An equation to compute the dp-rank of any abelian group is given. It is also shown that its dp-rank, or more generally that of any one-based group, agrees with its Vapnik–Chervonenkis density. Furthermore, strong abelian groups are characterised to be precisely those abelian groups A such that there are only finitely many primes p such that the group A / pA is infinite and for every prime p , there are only finitely many natural numbers n such that $\left( {p^n A} \right)[p]/\left( {p^{n + 1} A} \right)[p]$ is infinite. Finally, it is shown that an infinite stable field of finite dp-rank is algebraically closed.
We prove that in NTP_2 theories if p is a dependent type with dp-rank >= \kappa, then this can be witnessed by indiscernible sequences of tuples satisfying p. If p …
We prove that in NTP_2 theories if p is a dependent type with dp-rank >= \kappa, then this can be witnessed by indiscernible sequences of tuples satisfying p. If p has dp-rank infinity, then this can be witnessed by singletons (in any theory).
We show that every unstable NIP theory admits a V-definable linear quasi-order, over a finite set of parameters. In particular, if the theory is omega-categorical, then it interprets an infinite …
We show that every unstable NIP theory admits a V-definable linear quasi-order, over a finite set of parameters. In particular, if the theory is omega-categorical, then it interprets an infinite linear order. This partially answers a longstanding open question.
Peterzil and Steinhorn proved that if a group $G$ definable in an $o$-minimal structure is not definably compact, then $G$ contains a definable torsion-free subgroup of dimension one. We prove …
Peterzil and Steinhorn proved that if a group $G$ definable in an $o$-minimal structure is not definably compact, then $G$ contains a definable torsion-free subgroup of dimension one. We prove here a $p$-adic analogue of the Peterzil-Steinhorn theorem, in the special case of abelian groups. Let $G$ be an abelian group definable in a $p$-adically closed field $M$. If $G$ is not definably compact then there is a definable subgroup $H$ of dimension one which is not definably compact. In a future paper we will generalize this to non-abelian $G$.
In this paper, we study VC-density over indiscernible sequences (denoted VC_ind-density). We answer an open question in [1], showing that VC_ind-density is always integer valued. We also show that VC_ind-density …
In this paper, we study VC-density over indiscernible sequences (denoted VC_ind-density). We answer an open question in [1], showing that VC_ind-density is always integer valued. We also show that VC_ind-density and dp-rank coincide in the natural way.
We characterize nonforking (Morley) sequences in dependent theories in terms of a generalization of Poizat's special sequences and show that average types of Morley sequences are stationary over their domains. …
We characterize nonforking (Morley) sequences in dependent theories in terms of a generalization of Poizat's special sequences and show that average types of Morley sequences are stationary over their domains. We characterize generically stable types in terms of the structure of the "eventual" type. We then study basic properties of "strict Morley sequences", based on Shelah's notion of strict nonforking. In particular we prove "Kim's lemma" for such sequences, and a weak version of local character.
Abstract We develop the theory of generically stable types, independence relation based on nonforking and stable weight in the context of dependent theories.
Abstract We develop the theory of generically stable types, independence relation based on nonforking and stable weight in the context of dependent theories.
We give a characterization for those stable theories whose $\omega_{1}$-saturated models have a "Shelah-style" structure theorem. We use this characterization to prove that if a theory is countable, stable, and …
We give a characterization for those stable theories whose $\omega_{1}$-saturated models have a "Shelah-style" structure theorem. We use this characterization to prove that if a theory is countable, stable, and 1-based without dop or didip, then its $\omega_{1}$-saturated models have a structure theorem. Prior to us, this is proved in a paper of Hart, Pillay, and Starchenko (in which they also count the number of models, which we do not do here). Some other remarks are also included.
We study orthogonality, domination, weight, regular and minimal types in the contexts of rosy and super-rosy theories.
We study orthogonality, domination, weight, regular and minimal types in the contexts of rosy and super-rosy theories.
Abstract We study dp-minimal and strongly dependent theories and investigate connections between these notions and weight.
Abstract We study dp-minimal and strongly dependent theories and investigate connections between these notions and weight.
We investigate the notions of strict independence and strict non-forking, and establish basic properties and connections between the two. In particular it follows from our investigation that in resilient theories …
We investigate the notions of strict independence and strict non-forking, and establish basic properties and connections between the two. In particular it follows from our investigation that in resilient theories strict non-forking is symmetric. Based on this study, we develop notions of weight which characterize NTP2, dependence and strong dependence. Many of our proofs rely on careful analysis of sequences that witness dividing. We prove simple characterizations of such sequences in resilient theories, as well as of Morley sequences which are witnesses. As a by-product we obtain information on types co-dominated by generically stable types in dependent theories. For example, we prove that every Morley sequence in such a type is a witness.
Our thesis is that for the family of classes of the form EC(T),T a com- plete first order theory with the dependence property (which is just the negation of the …
Our thesis is that for the family of classes of the form EC(T),T a com- plete first order theory with the dependence property (which is just the negation of the independence property) there is a substantial theory which means: a substantial body of basic results for all such classes and some complimentary results for the first order theories with the independence property, as for the family of stable (and the family of simple) first order theories. We examine some properties.
We further investigate the class of models of a strongly dependent (first order complete) theory T, continuing math.LO/0406440. If |A|+|T| =beth_{|T|^+}(mu) then some J subseteq I of cardinality mu^+ is …
We further investigate the class of models of a strongly dependent (first order complete) theory T, continuing math.LO/0406440. If |A|+|T| =beth_{|T|^+}(mu) then some J subseteq I of cardinality mu^+ is an indiscernible sequence over A .
Abstract We show basic facts about dp-minimal ordered structures. The main results are: dp-minimal groups are abelian-by-finite-exponent, in a divisible ordered dp-minimal group, any infinite set has nonempty interior, and …
Abstract We show basic facts about dp-minimal ordered structures. The main results are: dp-minimal groups are abelian-by-finite-exponent, in a divisible ordered dp-minimal group, any infinite set has nonempty interior, and any theory of pure tree is dp-minimal.
We study the Vapnik–Chervonenkis (VC) density of definable families in certain stable first-order theories. In particular, we obtain uniform bounds on the VC density of definable families in finite U-rank …
We study the Vapnik–Chervonenkis (VC) density of definable families in certain stable first-order theories. In particular, we obtain uniform bounds on the VC density of definable families in finite U-rank theories without the finite cover property, and we characterize those abelian groups for which there exist uniform bounds on the VC density of definable families.