Vapnik-Chervonenkis classes of definable sets

No abstract is available for this paper.

• Publication year

  1992

• Venue

  Journal of The London Mathematical Society-second Series

• Publication date

  1992-04-01

• Fields of study

  Mathematics

• Identifiers
  DOI 10.1112/JLMS/S2-45.2.377
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Some new Vapnik-Chervonenkis classes

  1989cited by this paper
• Semianalytic and subanalytic sets

  1988cited by this paper
• DEFINABLE SETS IN ORDERED STRUCTURES. I

  1986cited by this paper
• A generalization of the Tarski-Seidenberg theorem, and some nondefinability results

  1986cited by this paper
• A course on empirical processes

  1984cited by this paper
• Invariance principles for sums of Banach space valued random elements and empirical processes

  1983cited by this paper
• Théories instables

  1981cited by this paper
• Central Limit Theorems for Empirical Measures

  1978influential reference
• Almost disjoint sets, the dense set problem and the partition calculus

  1976cited by this paper
• Stability, the f.c.p., and superstability; model theoretic properties of formulas in first order theory

  1971influential reference
• Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities

  1971influential reference
• Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics

  1966cited by this paper
• ON CONVERGENCE OF STOCHASTIC PROCESSES

  1962cited by this paper

• On the generalized coloring numbers

  2026cites this paper
• Epsilon-saturation for stable graphs and Littlestone classes

  2025cites this paper
• Provable test-time adaptivity and distributional robustness of in-context learning

  2025influential citation
• ON THE CHASE-FREITAG LEMMA

  2025cites this paper
• VC-dimension of generalized progressions in some nonabelian groups

  2025cites this paper
• Network traffic monitoring based on CNN-SVM

  2025cites this paper
• The unstable formula theorem revisited via algorithms

  2025cites this paper
• Neural network learning and Quantum Gravity

  2024cites this paper
• Embedded Finite Models beyond Restricted Quantifier Collapse

  2023cites this paper
• VC-density and abstract cell decomposition for edge relation in graphs of bounded twin-width

  2022cites this paper
• Private and Online Learnability Are Equivalent

  2022cites this paper
• The unstable formula theorem revisited

  2022cites this paper
• Distal Combinatorial Tools for Graphs of Bounded Twin-Width

  2022cites this paper
• The unstable formula theorem revisited via algorithms

  2022cites this paper
• Uniformly supported approximate equilibria in families of games

  2021cites this paper
• From undecidability of non-triviality and finiteness to undecidability of learnability

  2021cites this paper
• On the Parameterized Complexity of Learning Logic

  2021cites this paper
• Agnostic Online Learning and Excellent Sets

  2021cites this paper
• Binary strings of finite VC dimension

  2021cites this paper
• Glivenko–Cantelli classes and NIP formulas

  2021cites this paper
• Divide and Conquer: Dividing Lines and Universality

  2021cites this paper
• Ranks Based on Fraisse Classes

  2020cites this paper
• Ranks based on strong amalgamation Fraïssé classes

  2020cites this paper
• Functions over Main Diagonal

  2020cites this paper
• The Reasonable Effectiveness of Model Theory in Mathematics

  2020cites this paper
• 1 . 1 Littlestone dimension vs . approximate private learning

  2019cites this paper
• Query Preserving Watermarking Schemes for Locally Treelike Databases

  2019influential citation
• Local and Global Approaches to Study of Decision and Inhibitory Trees and Rule Systems

  2019cites this paper
• Private PAC learning implies finite Littlestone dimension

  2018cites this paper
• Computational Learning Theory FoPPS Logic and Learning School

  2018cites this paper
• A statistical learning approach to a problem of induction

  2018cites this paper
• Model Theory Methods for Topological Groups

  2018cites this paper
• MODEL THEORY AND MACHINE LEARNING

  2018influential citation
• MODEL THEORY AND COMBINATORICS OF BANNED SEQUENCES

  2018cites this paper
• On the number of types in sparse graphs

  2017cites this paper
• THICKET DENSITY

  2017cites this paper
• Structural sparsity

  2016cites this paper
• TOPICS IN COMBINATORICS (MATH 285N, UCLA, WINTER 2016)

  2016cites this paper
• Groups and Fields in Neostable Theories Chain : conditions and Definable Envelopes

  2016cites this paper
• RAMSEY GROWTH IN SOME NIP STRUCTURES

  2016cites this paper
• EXISTENCE OF MODELING LIMITS FOR SEQUENCES OF SPARSE STRUCTURES

  2016influential citation
• VARIATIONS SUR UN THÈME DE ALDAMA ET SHELAH

  2016cites this paper
• A Paper that Created Three New Fields: Teoriya Veroyatnosteĭ i Ee Primeneniya 16(2), 1971, pp. 264–279

  2015cites this paper
• Measures of Complexity

  2015cites this paper
• Definably amenable NIP groups

  2015cites this paper
• Regularity lemma for distal structures

  2015cites this paper
• On VC-Density in VC-Minimal Theories

  2014cites this paper
• Computability of validity and satisfiability in probability logics over finite and countable models

  2014cites this paper
• On Vapnik‐Chervonenkis density over indiscernible sequences

  2014cites this paper
• The dynamical hierarchy for Roelcke precompact Polish groups

  2014cites this paper
• Interpreting nowhere dense graph classes as a classical notion of model theory

  2014cites this paper
• Model Theory in Algebra, Analysis and Arithmetic: A Preface

  2014cites this paper
• On a common generalization of Shelah's 2-rank, dp-rank, and o-minimal dimension

  2013cites this paper
• A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth

  2013cites this paper
• The Regularity Lemma with bounded VC Dimension

  2013cites this paper
• Vapnik-Chervonenkis Density on Indiscernible Sequences, Stability, and the Maximum Property

  2013cites this paper
• Test Theory: Tools and Applications

  2013cites this paper
• Honest Compressions and Their Application to Compression Schemes

  2013cites this paper
• A Guide to NIP Theories

  2012cites this paper
• Measurability Aspects of the Compactness Theorem for Sample Compression Schemes

  2012cites this paper
• Externally definable sets and dependent pairs II

  2012cites this paper
• On Definability of Types in Dependent Theories

  2011cites this paper
• dp-Rank and Forbidden Configurations

  2011cites this paper
• Vapnik-Chervonenkis Density in Some Theories without the Independence Property, II

  2011influential citation
• Regularity lemmas for stable graphs

  2011cites this paper
• On VC-density over indiscernible sequences

  2011cites this paper
• Vapnik-Chervonenkis density in some theories without the independence property, I

  2011influential citation
• Compression Schemes, Stable Definable Families, and o-Minimal Structures

  2010cites this paper
• Nowhere dense graph classes, stability, and the independence property

  2010cites this paper
• Constraint Databases

  2010cites this paper
• A note on bounds for VC dimensions.

  2009cites this paper
• Structures having o-minimal open core

  2009cites this paper
• Theories controlled by formulas of Vapnik-Chervonenkis codimension 1

  2008cites this paper
• Continuous and random Vapnik-Chervonenkis classes

  2008cites this paper
• Introduction to O-minimality

  2008cites this paper
• Introduction to theories without the independence property

  2008influential citation
• Finite Model Theory and Its Applications

  2007cites this paper
• Embedded Finite Models and Constraint Databases

  2007influential citation
• Two Tier Secure Routing Protocol for Heterogeneous Sensor Networks

  2007cites this paper
• Logical definability and query languages over ranked and unranked trees

  2007cites this paper
• Two Algorithms for Solving the Walrasian Equilibrium Inequalities

  2006cites this paper
• Decision Methods for Solving Systems of Walrasian Inequalities

  2005cites this paper
• Time Complexity of Decision Trees

  2005cites this paper
• Quelques remarques concernant la thorie des corps ordonns diffrentiellement clos

  2005cites this paper
• CLASSIFICATION THEORY FOR ELEMENTARY CLASSES WITH THE DEPENDENCE PROPERTY-A MODEST BEGINNING

  2004cites this paper
• Model Theory: Geometrical and Set-Theoretic Aspects and Prospects

  2003cites this paper
• Definable relations and first-order query languages over strings

  2003cites this paper
• Learnability and Definability in Trees and Similar Structures

  2003cites this paper
• Aggregate Operators in Constraint Query Languages

  2002cites this paper
• Learnability and Definability in Trees and Similar Structures

  2002cites this paper
• Tree extension algebras: logics, automata, and query languages

  2002cites this paper
• Empirical Processes in Statistics: Methods, Examples, Further Problems

  2002influential citation
• Expressive Power: The Finite Case

  2000cites this paper
• Stability theory, permutations of indiscernibles, and embedded finite models

  2000cites this paper
• Weakly o-minimal structures and real closed fields

  2000cites this paper
• Pseudovaluation domains with vapnik-chervonenkis classes of definable sets

  2000influential citation
• On the independence property

  2000cites this paper
• Learning with recurrent neural networks

  2000cites this paper
• Exact and approximate aggregation in constraint query languages

  1999cites this paper
• Some Remarks About Asymptotic Couples

  1999cites this paper