English
Related papers

Related papers: Definability via the tilting correspondence

200 papers

Consider a Henselian rank one valued field $K$ of equicharacteristic zero with the three-sorted language $\mathcal{L}$ of Denef--Pas. Let $f: A \to K$ be a continuous $\mathcal{L}$-definable (with parameters) function on a closed bounded…

Algebraic Geometry · Mathematics 2017-02-17 Krzysztof Jan Nowak

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 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

We study function fields of curves over a base field $K$ which is either a global field or a large field having a separable field extension of degree divisible by $4$. We show that, for any such function field, Hilbert's 10th Problem has a…

Number Theory · Mathematics 2025-09-24 Karim Johannes Becher , Nicolas Daans , Philip Dittmann

Consider a Henselian rank one valued field $K$ of equicharacteristic zero along with the language $\mathcal{L}^{P}$ of Denef--Pas. Let $f: A \to K$ be an $\mathcal{L}^{P}$-definable (with parameters) function on a subset $A$ of $K^{n}$. We…

Algebraic Geometry · Mathematics 2017-02-28 Krzysztof Jan Nowak

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

We provide a sound and complete proof system for an extension of Kleene's ternary logic to predicates. The concept of theory is extended with, for each function symbol, a formula that specifies when the function is defined. The notion of…

Logic · Mathematics 2023-03-28 Antti Valmari , Lauri Hella

Hadwiger's Theorem states that Euclidean-invariant convex-continuous valuations of definable sets are linear combinations of intrinsic volumes. We lift this result from sets to data distributions over sets, specifically, to definable…

Differential Geometry · Mathematics 2013-07-02 Yuliy Baryshnikov , Robert Ghrist , Matthew Wright

We study the algebraic implications of the non-independence property (NIP) and variants thereof (dp-minimality) on infinite fields, motivated by the conjecture that all such fields which are neither real closed nor separably closed admit a…

Logic · Mathematics 2018-12-05 Katharina Dupont , Assaf Hasson , Salma Kuhlmann

We give a semantics for the lambda-calculus based on a topological duality theorem in nominal sets. A novel interpretation of lambda is given in terms of adjoints, and lambda-terms are interpreted absolutely as sets (no valuation is…

Logic in Computer Science · Computer Science 2016-10-07 Murdoch J. Gabbay , Michael J. Gabbay

Considering quantales as generalised noncommutative spaces, we address as an example a quantale Pen based on the Penrose tilings of the plane. We study in general the representations of involutive quantales on those of binary relations, and…

Category Theory · Mathematics 2007-05-23 Christopher J. Mulvey , Pedro Resende

Recently, Anscombe and Koenigsmann gave an existential 0-definition of the ring of formal power series F[[t]] in its quotient field in the case where F is finite. We extend their method in several directions to give general definability…

Commutative Algebra · Mathematics 2013-07-25 Arno Fehm

In semialgebraic geometry, projections play a prominent role. A definable choice is a semialgebraic selection of one point in every fiber of a projection. Definable choices exist by semialgebraic triviality, but their complexity depends…

Algebraic Geometry · Mathematics 2025-03-11 Antonio Lerario , Luca Rizzi , Daniele Tiberio

We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propagate completely have natural parameters which make them…

Artificial Intelligence · Computer Science 2009-03-04 Christian Bessiere , Emmanuel Hebrard , Brahim Hnich , Zeynep Kiziltan , Toby Walsh

This article is the second part in the series of articles where we are developing theory of valuations on manifolds. Roughly speaking valuations could be thought as finitely additive measures on a class of nice subsets of a manifold which…

Metric Geometry · Mathematics 2007-05-23 Semyon Alesker

A study of the relation between a noetherian local domain with a given valuation and its associated graded ring with respect to the valuation, which in some cases is an esentially toric variety, possibly of infinite embedding dimension, but…

Commutative Algebra · Mathematics 2007-05-23 Bernard Teissier

We develop the notion of deformations using a valuation ring as ring of coefficients. This permits to consider in particular the classical Gerstenhaber deformations of associative or Lie algebras as infinitesimal deformations and to solve…

Rings and Algebras · Mathematics 2007-05-23 Michel Goze , Elisabeth Remm

We prove that for every indecomposable ordinal there exists a (transfinitely valued) Euclidean domain whose minimal Euclidean norm is of that order type. Conversely, any such norm must have indecomposable type, and so we completely…

Commutative Algebra · Mathematics 2018-08-30 Chris J. Conidis , Pace P. Nielsen , Vandy Tombs

We present an intuitionistic interpretation of Euler-Venn diagrams with respect to Heyting algebras. In contrast to classical Euler-Venn diagrams, we treat shaded and missing zones differently, to have diagrammatic representations of…

Logic in Computer Science · Computer Science 2020-02-10 Sven Linker

The synthesis problem asks to automatically generate, if it exists, an algorithm from a specification of correct input-output pairs. In this paper, we consider the synthesis of computable functions of infinite words, for a classical Turing…

Formal Languages and Automata Theory · Computer Science 2024-02-09 Emmanuel Filiot , Sarah Winter