English
Related papers

Related papers: Externally definable sets and dependent pairs

200 papers

Reynolds' parametricity originally equips types with proof-irrelevant binary propositional relations over the types. But such relations can also be taken proof-relevant or unary, and described either in an indexed or fibred way.…

Logic in Computer Science · Computer Science 2026-02-16 Hugo Herbelin , Ramkumar Ramachandra

The class of problems complete for NP via first-order reductions is known to be characterized by existential second-order sentences of a fixed form. All such sentences are built around the so-called generalized IS-form of the sentence that…

Computational Complexity · Computer Science 2007-06-26 Nerio Borges , Blai Bonet

Let $K$ be a Henselian, non-trivially valued field with separated analytic structure. We prove the existence of definable retractions onto an arbitrary closed definable subset of $K^{n}$. Hence directly follow definable non-Archimedean…

Algebraic Geometry · Mathematics 2019-02-01 Krzysztof Jan Nowak

Boney and Grossberg [BG] proved that every nice AEC has an independence relation. We prove that this relation is unique: In any given AEC, there can exist at most one independence relation that satisfies existence, extension, uniqueness and…

Logic · Mathematics 2016-04-27 Will Boney , Rami Grossberg , Alexei Kolesnikov , Sebastien Vasey

A definable type of a first-order theory is the same as a section (retraction) of the simplicial path space (decalage) of its space of types viewed as a simplicial topological space; as is well-known, in the category of simplicial sets such…

Category Theory · Mathematics 2023-03-31 Misha Gavrilovich

We introduce the notions of triviality and order-triviality for global invariant types in an arbitrary first-order theory and show that they are well behaved in the NIP context. We show that these two notions agree for invariant global…

Logic · Mathematics 2026-02-24 Slavko Moconja , Predrag Tanović

We give a new characterization of $SOP$ (the strict order property) in terms of the behaviour of formulas in any model of the theory as opposed to having to look at the behaviour of indiscernible sequences inside saturated ones. We refine a…

Logic · Mathematics 2022-03-23 Karim Khanaki

First Order Team Semantics is a generalization of Tarskian Semantics in which formulas are satisfied with respect to sets of assignments. In Team Semantics, it is possible to extend First Order Logic via new types of atoms that describe…

Logic · Mathematics 2025-06-19 Pietro Galliani

By using nonstandard analysis, we prove embeddability properties of difference sets $A-B$ of sets of integers. (A set $A$ is "embeddable" into $B$ if every finite configuration of $A$ has shifted copies in $B$.) As corollaries of our main…

Logic · Mathematics 2013-12-25 Mauro Di Nasso

We initiate the study of definable V-topolgies and show that there is at most one such V-topology on a t-henselian NIP field. Equivalently, we show that if $(K,v_1,v_2)$ is a bi-valued NIP field with $v_1$ henselian (resp. t-henselian) then…

Logic · Mathematics 2019-02-15 Yatir Halevi , Assaf Hasson , Franziska Jahnke

In this note we study sets of NIP formulas in some theories of fields and valued fields, with a special focus on the sets of quantifier-free and existential formulas. First, we give a new proof of the fact that Separably Closed Valued…

Logic · Mathematics 2026-02-04 Paulo Andrés Soto Moreno

We prove the existence of definable retractions onto arbitrary closed subsets of $K^{n}$ definable over Henselian valued fields $K$. Hence directly follows non-Archimedian analogues of the Tietze--Urysohn and Dugundji theorems on extending…

Algebraic Geometry · Mathematics 2019-04-02 Krzysztof Jan Nowak

We investigate the possibility of distinguishing among different causal relations starting from a limited set of marginals. Our main tool is the notion of adhesivity, that is, the extension of probability or entropies defined only on…

Quantum Physics · Physics 2016-10-28 Costantino Budroni , Nikolai Miklin , Rafael Chaves

We introduce and study semi-equational and weakly semi-equational theories, generalizing equationality in stable theories (in the sense of Srour) to the NIP context. In particular, we establish a connection to distality via one-sided strong…

Logic · Mathematics 2023-05-08 Artem Chernikov , Alex Mennen

We introduce ordinal collapsing principles that are inspired by proof theory but have a set theoretic flavor. These principles are shown to be equivalent to iterated $\Pi^1_1$-comprehension and the existence of admissible sets, over weak…

Logic · Mathematics 2021-12-16 Anton Freund , Michael Rathjen

We introduce and study a natural class of fields in which certain first-order definable sets are existentially definable, and characterise this class by a number of equivalent conditions. We show that global fields belong to this class, and…

Logic · Mathematics 2023-06-22 Philip Dittmann , Dion Leijnse

For certain theories of existentially closed topological differential fields, we show that there is a strong relationship between $\mathcal L\cup\{D\}$-definable sets and their $\mathcal L$-reducts, where $\mathcal L$ is a relational…

Logic · Mathematics 2017-07-26 Françoise Point

We generalize the construction of elliptic stable envelopes to actions of connected reductive groups and give a direct inductive proof of their existence and uniqueness in a rather general situation. We show these have powerful enumerative…

Algebraic Geometry · Mathematics 2021-04-30 Andrei Okounkov

We present a new fragment of axiomatic set theory for pure sets and for the iteration of power sets within given transitive sets. It turns out that this formal system admits an interesting hierarchy of models with true membership relation…

Logic · Mathematics 2026-02-27 Matthias Kunik

We prove a generalizations of the Elekes-Szab\'o theorem for relations definable in strongly minimal structures that are interpretable in distal structures.

Logic · Mathematics 2020-07-24 Artem Chernikov , Sergei Starchenko