NIP formulas and Baire 1 definability

Abstract

In this short note, using results of Bourgain, Fremlin, and Talagrand BFT, we show that for a countable structure M, a saturated elementary extension M* of M and a formula φ(x,y) the following are equivalent: (i) φ(x,y) is NIP on M (in the sense of Definition 2.1). (ii) Whenever p(x)∈ Sφ(M*) is finitely satisfiable in M then it is Baire 1 definable over M (in sense of Definition 2.5).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…