NIP formulas and Baire 1 definability
Logic
2017-04-04 v2
Abstract
In this short note, using results of Bourgain, Fremlin, and Talagrand \cite{BFT}, we show that for a countable structure , a saturated elementary extension of and a formula the following are equivalent: (i) is NIP on (in the sense of Definition 2.1). (ii) Whenever is finitely satisfiable in then it is Baire 1 definable over (in sense of Definition 2.5).
Cite
@article{arxiv.1703.08731,
title = {NIP formulas and Baire 1 definability},
author = {Karim Khanaki},
journal= {arXiv preprint arXiv:1703.08731},
year = {2017}
}