Related papers: NIP formulas and Baire 1 definability

Marker and Steinhorn shown that given two models $M\prec N$ of an o-minimal theory, if all 1-types over $M$ realized in $N$ are definable, then all types over $M$ realized in $N$ are definable. In this article we characterize pairs of…

We give several characterizations of when a complete first-order theory $T$ is monadically NIP, i.e. when expansions of $T$ by arbitrary unary predicates do not have the independence property. The central characterization is a condition on…

We prove a definable version of Matou\v{s}ek's $(p,q)$-theorem in NIP theories. This answers a question of Chernikov and Simon. We also prove a uniform version. The proof builds on a proof of Boxall and Kestner who proved this theorem in…

We investigate the theory PAI (Peano Arithmetic with Indiscernibles). Models of PAI are of the form (M, I), where M is a model of PA, I is an unbounded set of order indiscernibles over M, and (M, I) satisfies the extended induction scheme…

Combining two results from machine learning theory we prove that a formula is NIP if and only if it satisfies uniform definability of types over finite sets (UDTFS). This settles a conjecture of Laskowski.

Fix a weakly minimal (i.e., superstable $U$-rank $1$) structure $\mathcal{M}$. Let $\mathcal{M}^*$ be an expansion by constants for an elementary substructure, and let $A$ be an arbitrary subset of the universe $M$. We show that all…

We consider the complexity (in terms of the arithmetical hierarchy) of the various quantifier levels of the diagram of a computably presented metric structure. As the truth value of a sentence of continuous logic may be any real in $[0,1]$,…

We consider an extension of the unary negation fragment of first-order logic in which arbitrarily many binary symbols may be required to be interpreted as equivalence relations. We show that this extension has the finite model property.…

Topologies $\tau, \sigma$ on a set $X$ are called $\pi$-compatible if $\tau$ is a $\pi$-network for $\sigma$, and vice versa. If topologies $\tau, \sigma$ on a set $X$ are $\pi$-compatible then the families of nowhere dense sets (resp.…

A visceral structure on M is given by a definable base for a uniform topology on its universe in which all basic open sets are infinite and any infinite definable subset X of M has non-empty interior. This context includes o-minimal ordered…

In this paper, we show that \phi is a dependent formula if and only if all \phi-types have an extension to a \phi-isolated \phi-type that is an "elementary \phi-extension" (see Definition 2.3 in the paper). Moreover, we show that the domain…

We develop a general framework (multidimensional asymptotic classes, or m.a.c.s) for handling classes of finite first order structures with a strong uniformity condition on cardinalities of definable sets: The condition asserts that…

We prove that externally definable sets in first order NIP theories have honest definitions, giving a new proof of Shelah's expansion theorem. Also we discuss a weak notion of stable embeddedness true in this context. Those results are then…

The back-and-forth relations $M\leq_\alpha N$ are central to computable structure theory and countable model theory. It is well-known that the relation $\{(M,N) : M \leq_\alpha N\}$ is (lightface) $\Pi^0_{2\alpha}$. We show that this is…

Let T be an NIP L-theory and T' be an enrichment. We give a sufficient condition on T' for the underlying L-type of any definable (respectively invariant) type over a model of T' to be definable (respectively invariant) as an L-type.…

Let $(M,\scott X) \models \ACA$ be such that $P_\scott X$, the collection of all unbounded sets in $\scott X$, admits a definable complete ultrafilter and let $T$ be a theory extending first order arithmetic coded in $\scott X$ such that…

Suppose a map $\phi$ on the set of positive definite matrices satisfies $\det(A+B)=\det(\phi(A)+\phi(B))$. Then we have $${\rm tr}(AB^{-1}) = {\rm tr}(\phi(A){\phi(B)}^{-1}).$$ Through this viewpoint, we show that $\phi$ is of the form…

We consider a structure $\mathcal {M} = \langle \mathbb N, \{Tr,<\} \rangle$, where the relation $Tr(a,x,y)$ with a parameter $ a$ defines a family of trees on $\mathbb N$ and $<$ is the usual order on $\mathbb N$. We show that if the…

Two structures $M, N$ in the same language are called probably isomorphic if they (or, in case of metric structures, their completions) are isomorphic after forcing with the Lebesgue measure algebra. We show that, if $M$ and $N$ are…

The depth-bounded fragment of the pi-calculus is an expressive class of systems enjoying decidability of some important verification problems. Unfortunately membership of the fragment is undecidable. We propose a novel type system,…