English
Related papers

Related papers: Glivenko-Cantelli classes and NIP formulas

200 papers

The Bodirsky-Pinsker conjecture asserts a P vs. NP-complete dichotomy for the computational complexity of Constraint Satisfaction Problems (CSPs) of first-order reducts of finitely bounded homogeneous structures. Prominently, two structures…

Logic · Mathematics 2026-02-03 Roman Feller , Michael Pinsker

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…

Logic · Mathematics 2022-12-19 Ali Enayat

Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…

Logic · Mathematics 2025-12-03 Jake Masters

This paper proposes a new notion of typical sequences on a wide class of abstract alphabets (so-called standard Borel spaces), which is based on approximations of memoryless sources by empirical distributions uniformly over a class of…

Information Theory · Computer Science 2016-11-17 Maxim Raginsky

We introduce reflection properties of cardinals in which the attributes that reflect are expressible by infinitary formulas whose lengths can be strictly larger than the cardinal under consideration. This kind of generalized reflection…

Logic · Mathematics 2022-10-14 Brent Cody

Dag Normann and the author have recently initiated the study of the logical and computational properties of the uncountability of $\mathbb{R}$ formalised as the statement $\textsf{NIN}$ (resp. $\textsf{NBI}$ that there is no injection…

Logic · Mathematics 2020-11-06 Sam Sanders

Let $T$ be a (first order complete) dependent theory, ${\mathfrak{C}}$ a $\bar\kappa$-saturated model of $T$ and $G$ a definable subgroup which is abelian. Among subgroups of bounded index which are the union of $<\bar\kappa$ type definable…

Logic · Mathematics 2021-09-15 Saharon Shelah

Assume that $p>2$, and let $\mathscr{O}_K$ be a $p$-adic discrete valuation ring with residue field admitting a finite $p$-basis, and let $R$ be a formally smooth formally finite-type $\mathscr{O}_K$-algebra. (Indeed, we allow slightly more…

Number Theory · Mathematics 2013-10-30 Wansu Kim

The Kestelman-Borwein-Ditor Theorem asserts that a non-negligible subset of $\mathbb{R}$ which is Baire (=has the Baire property, BP) or measurable is shift-compact: it contains some subsequence of any null sequence to within translation by…

Classical Analysis and ODEs · Mathematics 2019-01-29 H. I. Miller , L. Miller-Van Wieren , A. J. Ostaszewski

A theory $T$ is said to be relatively decidable if for every model of $T$, one can compute the elementary diagram of that model from its atomic diagram together with $T$. We verify a conjecture of Chubb, Miller, and Solomon by showing that…

Logic · Mathematics 2026-04-21 Matthew Harrison-Trainor , Liam Tan

This paper introduces higher-order (``nested") Kripke models, a generalization of Kripke models that is remarkably close to Kripke's original idea -- both mathematically and conceptually. Standard models are now $0$-ary models, whereas…

Logic in Computer Science · Computer Science 2026-05-07 Victor Barroso-Nascimento

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…

Logic · Mathematics 2019-07-16 Evgeny Kolmakov , Lev Beklemishev

There exist NIP and non-NTP$_2$ theories satisfying all the following conditions: It is not o-minimal; All models are strongly locally o-minimal; It has a model which is an expansion of the linearly ordered abelian group over the reals…

Logic · Mathematics 2022-08-18 Masato Fujita

Building on the locality conditions for first-order logic by Hanf and Gaifman, Barthelmann and Schwentick showed in 1999 that every first-order formula is equivalent to a formula of the shape $\exists x_1 \dotsc \exists x_k \forall y\,\phi$…

Logic in Computer Science · Computer Science 2018-10-30 André Frochaux , Lucas Heimberg

We develop some model theory of multi-linear forms, generalizing Granger in the bi-linear case. In particular, after proving a quantifier elimination result, we show that for an NIP field K, the theory of infinite dimensional non-degenerate…

Logic · Mathematics 2025-04-01 Artem Chernikov , Nadja Hempel

We establish, for $1 < p < \infty$, higher order $\mathcal{S}^p$-differentiability results of the function $\varphi : t\in \mathbb{R} \mapsto f(A+tK) - f(A)$ for selfadjoint operators $A$ and $K$ on a separable Hilbert space $\mathcal{H}$…

Functional Analysis · Mathematics 2019-06-14 Clément Coine

An extension of Marcinkiewicz Interpolation Theorem, allowing intermediate spaces of Orlicz type, is proved. This generalization yields a necessary and sufficient condition so that every quasilinear operator, which maps the set, $S(X,\mu)$,…

Classical Analysis and ODEs · Mathematics 2017-11-28 Ron Kerman , Rama Rawat , Rajesh K. Singh

We prove that for every simple theory $T$ (or even simple thick compact abstract theory) there is a (unique) compact abstract theory $T^\fP$ whose saturated models are the lovely pairs of $T$. Independence-theoretic results that were proved…

Logic · Mathematics 2009-02-05 Itaï Ben Yaacov

Let K be an algebraically bounded structure and T be its theory. If T is model complete, then the theory of K endowed with a derivation, denoted by $T^{\delta}$, has a model completion. Additionally, we prove that if the theory T is…

Logic · Mathematics 2024-11-14 Fornasiero Antongiulio , Terzo Giuseppina

We show that any theory of tame henselian valued fields is NIP if and only if the theory of its residue field and the theory of its value group are NIP. Moreover, we show that if $(K,v)$ is a henselian valued field of residue characteristic…

Logic · Mathematics 2019-04-03 Franziska Jahnke , Pierre Simon
‹ Prev 1 4 5 6 7 8 10 Next ›