Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

NIP formulas and Baire 1 definability (1703.08731v2)

Published 25 Mar 2017 in math.LO

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

We haven't generated a summary for this paper yet.