Switch to: References

Add citations

You must login to add citations.
  1. Topological properties of definable sets in ordered Abelian groups of burden 2.Alfred Dolich & John Goodrick - 2023 - Mathematical Logic Quarterly 69 (2):147-164.
    We obtain some new results on the topology of unary definable sets in expansions of densely ordered Abelian groups of burden 2. In the special case in which the structure has dp‐rank 2, we show that the existence of an infinite definable discrete set precludes the definability of a set which is dense and codense in an interval, or of a set which is topologically like the Cantor middle‐third set (Theorem 2.9). If it has burden 2 and both an infinite (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Dp-Minimality: Basic Facts and Examples.Alfred Dolich, John Goodrick & David Lippel - 2011 - Notre Dame Journal of Formal Logic 52 (3):267-288.
    We study the notion of dp-minimality, beginning by providing several essential facts about dp-minimality, establishing several equivalent definitions for dp-minimality, and comparing dp-minimality to other minimality notions. The majority of the rest of the paper is dedicated to examples. We establish via a simple proof that any weakly o-minimal theory is dp-minimal and then give an example of a weakly o-minimal group not obtained by adding traces of externally definable sets. Next we give an example of a divisible ordered Abelian (...)
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • Some remarks on inp-minimal and finite burden groups.Jan Dobrowolski & John Goodrick - 2019 - Archive for Mathematical Logic 58 (3-4):267-274.
    We prove that any left-ordered inp-minimal group is abelian and we provide an example of a non-abelian left-ordered group of dp-rank 2. Furthermore, we establish a necessary condition for a group to have finite burden involving normalizers of definable sets, reminiscent of other chain conditions for stable groups.
    Download  
     
    Export citation  
     
    Bookmark  
  • Theories without the tree property of the second kind.Artem Chernikov - 2014 - Annals of Pure and Applied Logic 165 (2):695-723.
    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 ; 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • The canonical topology on dp-minimal fields.Will Johnson - 2018 - Journal of Mathematical Logic 18 (2):1850007.
    We construct a nontrivial definable type V field topology on any dp-minimal field K that is not strongly minimal, and prove that definable subsets of Kn have small boundary. Using this topology and...
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Vapnik–Chervonenkis Density in Some Theories without the Independence Property, II.Matthias Aschenbrenner, Alf Dolich, Deirdre Haskell, Dugald Macpherson & Sergei Starchenko - 2013 - Notre Dame Journal of Formal Logic 54 (3-4):311-363.
    We study the Vapnik–Chervonenkis 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 $\mathrm {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.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Strict independence.Itay Kaplan & Alexander Usvyatsov - 2014 - Journal of Mathematical Logic 14 (2):1450008.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • On omega-categorical simple theories.Daniel Palacín - 2012 - Archive for Mathematical Logic 51 (7-8):709-717.
    In the present paper we shall prove that countable ω-categorical simple CM-trivial theories and countable ω-categorical simple theories with strong stable forking are low. In addition, we observe that simple theories of bounded finite weight are low.
    Download  
     
    Export citation  
     
    Bookmark  
  • Weight and Measure in NIP Theories.Anand Pillay - 2013 - Notre Dame Journal of Formal Logic 54 (3-4):567-578.
    We initiate an account of Shelah’s notion of “strong dependence” in terms of generically stable measures, proving a measure analogue of the fact that a stable theory $T$ is “strongly dependent” if and only if all types have almost finite weight.
    Download  
     
    Export citation  
     
    Bookmark  
  • On VC-minimal fields and dp-smallness.Vincent Guingona - 2014 - Archive for Mathematical Logic 53 (5-6):503-517.
    In this paper, we show that VC-minimal ordered fields are real closed. We introduce a notion, strictly between convexly orderable and dp-minimal, that we call dp-small, and show that this is enough to characterize many algebraic theories. For example, dp-small ordered groups are abelian divisible and dp-small ordered fields are real closed.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • dp-Rank and Forbidden Configurations.Hunter Johnson - 2013 - Notre Dame Journal of Formal Logic 54 (1):1-13.
    A theory $T$ is shown to have an ICT pattern of depth $k$ in $n$ variables iff it interprets some $k$ -maximum VC class in $n$ parameters.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A Family of dp-Minimal Expansions of (Z;+).Chieu-Minh Tran & Erik Walsberg - 2023 - Notre Dame Journal of Formal Logic 64 (2):225-238.
    We consider structures of the form (Z;+,C), where C is an additive cyclic order on (Z;+). We show that such structures are dp-minimal and in this way produce a continuum-size family of dp-minimal expansions of (Z;+) such that no two members of the family define the same subsets of Z.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Strongly NIP almost real closed fields.Lothar Sebastian Krapp, Salma Kuhlmann & Gabriel Lehéricy - 2021 - Mathematical Logic Quarterly 67 (3):321-328.
    The following conjecture is due to Shelah–Hasson: Any infinite strongly NIP field is either real closed, algebraically closed, or admits a non‐trivial definable henselian valuation, in the language of rings. We specialise this conjecture to ordered fields in the language of ordered rings, which leads towards a systematic study of the class of strongly NIP almost real closed fields. As a result, we obtain a complete characterisation of this class.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Witnessing Dp-Rank.Itay Kaplan & Pierre Simon - 2014 - Notre Dame Journal of Formal Logic 55 (3):419-429.
    We prove that in $\operatorname {NTP}_{\operatorname {2}}$ theories the dp-rank of a type can be witnessed by indiscernible sequences of tuples satisfying that type. If the type has dp-rank infinity, then this can be witnessed by singletons.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • A conjectural classification of strongly dependent fields.Yatir Halevi, Assaf Hasson & Franziska Jahnke - 2019 - Bulletin of Symbolic Logic 25 (2):182-195.
    We survey the history of Shelah’s conjecture on strongly dependent fields, give an equivalent formulation in terms of a classification of strongly dependent fields and prove that the conjecture implies that every strongly dependent field has finite dp-rank.
    Download  
     
    Export citation  
     
    Bookmark   5 citations