Switch to: Citations

Add references

You must login to add references.
  1. Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems.Christian Michaux & Roger Villemaire - 1996 - Annals of Pure and Applied Logic 77 (3):251-277.
    Let be the set of nonnegative integers. We show the two following facts about Presburger's arithmetic:1. 1. Let . If L is not definable in , + then there is an definable in , such that there is no bound on the distance between two consecutive elements of L′. and2. 2. is definable in , + if and only if every subset of which is definable in is definable in , +. These two Theorems are of independent interest but we (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  • 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 (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   24 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.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   11 citations