Related papers: Glivenko-Cantelli classes and NIP formulas

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 develop a theory of generically stable and smooth Keisler measures in NIP metric theories, generalizing the case of classical logic. Using smooth extensions, we verify that fundamental properties of (Borel)-definable measures and the…

We study and characterize stability, NIP and NSOP in terms of topological and measure theoretical properties of classes of functions. We study a measure theoretic property, `Talagrand's stability', and explain the relationship between this…

S-metric and b-metric spaces are metrizable, but it is still quite impossible to get an explicit form of the concerned metric function. To overcome this, the notion of $\phi$-metric is developed by making a suitable modification in triangle…

This report introduces and investigates a family of metrics on sets of pointed Kripke models. The metrics are generalizations of the Hamming distance applicable to countably infinite binary strings and, by extension, logical theories or…

Let $m,n\ge 2$ be positive integers, $M_m$ the set of $m\times m$ complex matrices and $M_n$ the set of $n\times n$ complex matrices. Regard $M_{mn}$ as the tensor space $M_m\otimes M_n$. Suppose $|\cdot|$ is the Ky Fan $k$-norm with $1 \le…

We refine results of Gannon [G21, Theorem 4.7] and Simon [S15a, Lemma 2.8] on equivalences of convergent Morley sequences. We then introduce the notion of eventual $NIP$, as a property of a model, and give a variant of [KP18, Corollary…

Non-forking is one of the most important notions in modern model theory capturing the idea of a generic extension of a type (which is a far-reaching generalization of the concept of a generic point of a variety). To a countable first-order…

We study approximate equivalence relations up to commensurability, in the presence of a definable measure. As a basic framework, we give a presentation of probability logic based on continuous logic. Hoover's normal form is valid here; if…

The Bessel-Neumann expansion (of integer order) of a function $g:\mathbb{C}\rightarrow\mathbb{C}$ corresponds to representing $g$ as a linear combination of basis functions $\phi_0,\phi_1,\ldots$, i.e., $g(z)=\sum_{\ell = 0}^\infty w_\ell…

We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…

The $\epsilon$-logic (which is called $\epsilon$E-logic in this paper) of Kuyper and Terwijn is a variant of first order logic with the same syntax, in which the models are equipped with probability measures and in which the $\forall x$…

In [Appl. Comput. Harmon. Anal., 46(3):664-673, 2019], O. Christensen and M. Hasannasab observed that assuming the existence of an operator $T$ sending $e_n$ to $e_{n+1}$ for all $n \in \mathbb{N}$ (where $(e_n)_{n \in \mathbb{N}}$ is a…

Let $(\mathfrak{M},\rho,\mu)$ be a metric measure space satisfying a doubling condition, $p_0\in (1,\infty)$, and $T(t):L^{p_0}(\mathfrak{M},\mu)\rightarrow L^{p_0}(\mathfrak{M},\mu)$, $t\geq 0$, a strongly continuous semi-group. We provide…

The purpose of the present paper is to prove for finitely generated groups of type I the following conjecture of A.Fel'shtyn and R.Hill, which is a generalization of the classical Burnside theorem. Let G be a countable discrete group, f one…

Let $X$ be a Polish space and $K$ a separable compact subset of the first Baire class on $X$. For every sequence $\bs$ dense in $\kk$, the descriptive set-theoretic properties of the set \[ \lbf=\{L\in[\nn]: (f_n)_{n\in L} \text{is…

We construct a countable simple theory which, in Keisler's order, is strictly above the random graph (but "barely so") and also in some sense orthogonal to the building blocks of the recently discovered infinite descending chain. As a…

Suppose L is a relational language and P in L is a unary predicate. If M is an L-structure then P(M) is the L-structure formed as the substructure of M with domain {a: M models P(a)}. Now suppose T is a complete first order theory in L with…

The bulk of this paper is devoted to the comparison of several models for the theory of (infinity,2)-categories: that is, higher categories in which all k-morphisms are invertible for k > 2 (the case of (infinity,n)-categories is also…

In the classification of complete first-order theories, many dividing lines have been defined in order to understand the complexity and the behavior of some classes of theories. In this paper, using the concept of patterns of consistency…