Switch to: References

Add citations

You must login to add citations.
  1. Computability of validity and satisfiability in probability logics over finite and countable models.Greg Yang - 2015 - Journal of Applied Non-Classical Logics 25 (4):324-372.
    The -logic of Terwijn is a variant of first-order logic with the same syntax in which the models are equipped with probability measures and the quantifier is interpreted as ‘there exists a set A of a measure such that for each,...’. Previously, Kuyper and Terwijn proved that the general satisfiability and validity problems for this logic are, i) for rational, respectively -complete and -hard, and ii) for, respectively decidable and -complete. The adjective ‘general’ here means ‘uniformly over all languages’. We (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  • Definability of types and VC density in differential topological fields.Françoise Point - 2018 - Archive for Mathematical Logic 57 (7-8):809-828.
    Given a model-complete theory of topological fields, we considered its generic differential expansions and under a certain hypothesis of largeness, we axiomatised the class of existentially closed ones. Here we show that a density result for definable types over definably closed subsets in such differential topological fields. Then we show two transfer results, one on the VC-density and the other one, on the combinatorial property NTP2.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • On expansions of.Quentin Lambotte & Françoise Point - 2020 - Annals of Pure and Applied Logic 171 (8):102809.
    Call a (strictly increasing) sequence (rn) of natural numbers regular if it satisfies the following condition: rn+1/rn→θ∈R>1∪{∞} and, if θ is algebraic, then (rn) satisfies a linear recurrence relation whose characteristic polynomial is the minimal polynomial of θ. Our main result states that (Z,+,0,R) is superstable whenever R is enumerated by a regular sequence. We give two proofs of this result. One relies on a result of E. Casanovas and M. Ziegler and the other on a quantifier elimination result. We (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Vapnik–Chervonenkis Density on Indiscernible Sequences, Stability, and the Maximum Property.Hunter Johnson - 2015 - Notre Dame Journal of Formal Logic 56 (4):583-593.
    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 $\mathrm {VC}_{\mathrm {ind}}$-density and use it to compute the exact $\mathrm {VC}_{\mathrm {ind}}$-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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Dp-minimal valued fields.Franziska Jahnke, Pierre Simon & Erik Walsberg - 2017 - Journal of Symbolic Logic 82 (1):151-165.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  • The dp-rank of Abelian groups.Yatir Halevi & Daniel Palacín - 2019 - Journal of Symbolic Logic 84 (3):957-986.
    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]/\left[p]$ is infinite.Finally, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • 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.
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • On VC-Density in VC-Minimal Theories.Vincent Guingona - 2022 - Notre Dame Journal of Formal Logic 63 (3):395-413.
    We show that any formula with two free variables in a Vapnik–Chervonenkis (VC) minimal theory has VC-codensity at most 2. Modifying the argument slightly, we give a new proof of the fact that, in a VC-minimal theory where acleq= dcleq, the VC-codensity of a formula is at most the number of free variables (from the work of Aschenbrenner et al., the author, and Laskowski).
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • There are no intermediate structures between the group of integers and Presburger arithmetic.Gabriel Conant - 2018 - Journal of Symbolic Logic 83 (1):187-207.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Thicket density.Siddharth Bhaskar - 2021 - Journal of Symbolic Logic 86 (1):110-127.
    We define a new type of “shatter function” for set systems that satisfies a Sauer–Shelah type dichotomy, but whose polynomial-growth case is governed by Shelah’s two-rank instead of VC dimension. We identify the least exponent bounding the rate of growth of the shatter function, the quantity analogous to VC density, with Shelah’s $\omega $ -rank.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • A new dp-minimal expansion of the integers.Eran Alouf & Christian D’elbée - 2019 - Journal of Symbolic Logic 84 (2):632-663.