On uniform definability of types over finite sets for NIP formulas

Journal of Mathematical Logic 21 (3) (2020)
  Copy   BIBTEX

Abstract

Combining two results from machine learning theory we prove that a formula is NIP if and only if it satisfies uniform definability of types over finite sets. This settles a conjecture of La...

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On uniform definability of types over finite sets.Vincent Guingona - 2012 - Journal of Symbolic Logic 77 (2):499-514.
Arithmetical definability over finite structures.Troy Lee - 2003 - Mathematical Logic Quarterly 49 (4):385.
Definability and definable groups in simple theories.Anand Pillay - 1998 - Journal of Symbolic Logic 63 (3):788-796.
Intrinsically Hyperarithmetical Sets.Ivan N. Soskov - 1996 - Mathematical Logic Quarterly 42 (1):469-480.
Characteristic Formulas of Partial Heyting Algebras.Alex Citkin - 2013 - Logica Universalis 7 (2):167-193.
The ordertype of β-r.E. Sets.Klaus Sutner - 1990 - Journal of Symbolic Logic 55 (2):573-576.
Index sets in the arithmetical Hierarchy.Ulrike Brandt - 1988 - Annals of Pure and Applied Logic 37 (2):101-110.
Definability and Definable Groups in Simple Theories.Anand Pillay - 1999 - Journal of Symbolic Logic 64 (3):788-796.
Definability and Definable Groups in Simple Theories.Anand Pillay - 1998 - Journal of Symbolic Logic 63 (3):788-796.

Analytics

Added to PP
2021-06-23

Downloads
4 (#1,426,245)

6 months
2 (#668,348)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references