Related papers: NIP formulas and Baire 1 definability

We give several new equivalences of $NIP$ for formulas and new proofs of known results using [T87] and [HOR91]. We emphasize that Keisler measures are more complicated than types (even in $NIP$ context), in an analytic sense. Among other…

Answering a special case of a question of Chernikov and Simon, we show that any non-dividing formula over a model M in a distal NIP theory is a member of a consistent definable family, definable over M.

We apply the work of Bourgain, Fremlin and Talagrand on compact subsets of the first Baire class to show new results about phi-types for phi NIP. In particular, we show that if M is a countable model, then an M-invariant phi-type is Borel…

We define the notion $\phi(x,y)$ has $NIP$ in $A$, where $A$ is a subset of a model, and give some equivalences by translating results from [1]. Using additional material from [11] we discuss the number of coheirs when $A$ is not…

We continue investigating the structure of externally definable sets in NIP theories and preservation of NIP after expanding by new predicates. Most importantly: types over finite sets are uniformly definable; over a model, a family of…

Suppose that ${\mathcal M}$ is a model of PA and ${\mathcal N}$ is a countably generated elementary end extension of ${\mathcal M}$. Let ${\mathfrak X}$ be the set of subsets of M that are coded by ${\mathcal N}$. Then ${\mathcal M}$ has a…

We consider an almost o-minimal expansion of an ordered group $\mathcal M=(M,<,+,0,\ldots)$ and its tame extension $\mathcal N=(N,<,+,0,\ldots)$. We demonstrate that the subset $\{x \in M^n\;|\; \mathcal N \models \Phi(x,a)\}$ of $M^n$…

In this paper, we show that a partitioned formula \phi is dependent if and only if \phi has uniform definability of types over finite partial order indiscernibles. This generalizes our result from a previous paper [1]. We show this by…

A computable structure $\mathcal{A}$ is decidable if, given a formula $\varphi(\bar{x})$ of elementary first-order logic, and a tuple $\bar{a} \in \mathcal{A}$, we have a decision procedure to decide whether $\varphi$ holds of $\bar{a}$. We…

We consider definably complete and Baire expansions of ordered fields: every definable subset of the domain of the structure has a supremum and the domain can not be written as the union of a definable increasing family of nowhere dense…

Let $\mathcal{R}$ be an $\mathrm{NIP}$ expansion of $(\mathbb{R},<,+)$ by closed subsets of $\mathbb{R}^n$ and continuous functions $f : \mathbb{R}^m \to \mathbb{R}^n$. Then $\mathcal{R}$ is generically locally o-minimal. It follows that if…

In this paper, a computably definable predicate is defined and characterized. Then, it is proved that every separable infinite-dimensional Hilbert structure in an effectively presented language is computable. Moreover, every definable…

We introduce the class of unshreddable theories, which contains the simple and NIP theories, and prove that such theories have exactly saturated models in singular cardinals, satisfying certain set-theoretic hypotheses. We also give…

The following two assertions are equivalent for an o-minimal expansion of an ordered group $\mathcal M=(M,<,+,0,\ldots)$. There exists a definable bijection between a bounded interval and an unbounded interval. Any definable continuous…

A subset of a topological space is constructible if it is a finite Boolean combination of closed sets. We prove that every NTP$_2$ expansion of $(\mathbb{R},<,+)$ by constructible sets defines only constructible sets, and that definable…

Let $m,n\ge 2$ be integers. Denote by $M_n$ the set of $n\times n$ complex matrices. Let $\|\cdot\|_{(p,k)}$ be the $(p,k)$ norm on $M_{mn}$ with $1\leq k\leq mn$ and $2<p<\infty$. We show that a linear map $\phi:M_{mn}\rightarrow M_{mn}$…

We will prove bi-interpretability of the arithmetic $\N = \langle N, +,\cdot, 0, 1\rangle$ and the weak second order theory of $\N$ with the free monoid $\mathbb{M}_X$ of finite rank greater than 1 and with a non-trivial partially…

Let $\mathcal{A}$ be a separable nuclear C*-algebra, and let $\mathcal{M}$ be a semifinite von Neumann factor with separable predual. Let $\phi, \psi: \mathcal{A} \rightarrow \mathcal{M}$ be essential trivial extensions with $\phi(a) -…

We give examples of $\mathrm{NIP}$ structures in which new algebraic structure appears in the Shelah completion. In particular we construct a weakly o-minimal structure $\mathscr{M}$ such that $\mathscr{M}$ does not interpret an infinite…

A formula $\phi$ is called \emph{$n$-provable} in a formal arithmetical theory $S$ if $\phi$ is provable in $S$ together with all true arithmetical $\Pi_{n}$-sentences taken as additional axioms. While in general the set of all $n$-provable…