Papers
Topics
Authors
Recent
Search
2000 character limit reached

NIP formulas and Baire 1 definability

Published 25 Mar 2017 in math.LO | (1703.08731v2)

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

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.