English
Related papers

Related papers: Ordered fields dense in their real closure and def…

200 papers

This paper is a sequel to [1] and considers definability in differential-henselian monotone fields with c-map and angular component map. We prove an Equivalence Theorem among whose consequences are a relative quantifier reduction and an NIP…

Logic · Mathematics 2018-06-11 Tigran Hakobyan

We shall define a general notion of dimension, and study groups and rings whose interpretable sets carry such a dimensio. In particular, we deduce chain conditions for groups, definability results for fields and domains, and show that…

Logic · Mathematics 2019-09-04 Frank Olaf Wagner

Let $\langle K,\nu \rangle$ be a real closed valued field, and let $S\subseteq K^n$ be an open semi-algebraic set. Using tools from model theory, we find an algebraic characterization of rational functions which admit, on $S$, only values…

Algebraic Geometry · Mathematics 2014-07-29 Noa Lavi

This paper finds a classification, up-to an isomorphism, of abelian torsion groups realizable as Brauer groups of major types of Henselian valued primarily quasilocal fields with totally indivisible value groups. When $E$ is a quasilocal…

Rings and Algebras · Mathematics 2011-05-06 Ivan Chipchakov

We prove that the theory of a Henselian valued field of characteristic zero, with finite ramification, and whose value group is a $Z$-group, is model-complete in the language of rings if the theory of its residue field is model-complete in…

Logic · Mathematics 2016-03-30 Jamshid Derakhshan , Angus Macintyre

A henselian valued field $K$ is called separably tame if its separable-algebraic closure $K^{\operatorname{sep}}$ is a tame extension, that is, the ramification field of the normal extension $K^{\operatorname{sep}}|K$ is…

Logic · Mathematics 2015-08-18 Franz-Viktor Kuhlmann , Koushik Pal

We study fragments of the existential theory of henselian valued fields with parameters. This includes the $\exists_n$-fragment in the equicharacteristic or unramified mixed characteristic case, the $\exists_n\exists_1$-fragment in the…

Logic · Mathematics 2026-05-05 Sylvy Anscombe , Arno Fehm

We study model theoretic properties of valued fields (equipped with a real-valued multiplicative valuation), viewed as metric structures in continuous first order logic. For technical reasons we prefer to consider not the valued field…

Logic · Mathematics 2013-05-08 Itaï Ben Yaacov

We develop a first-order theory of ordered transexponential fields in the language $\{+,\cdot,0,1,<,e,T\}$, where $e$ and $T$ stand for unary function symbols. While the archimedean models of this theory are readily described, the study of…

Logic · Mathematics 2023-07-24 Lothar Sebastian Krapp , Salma Kuhlmann

For $(K,v)$ a Henselian valued field, let $\theta\in\overline{K}$ with minimal polynomial $F$ over $K$. Okutsu sequences of $\theta$ have been defined only when the extension $K(\theta)/K$ is defectless. In this paper, we extend this…

Number Theory · Mathematics 2024-07-16 Enric Nart

We classify the stable formulas in the theory of Dense Linear Orders without endpoints, the stable formulas in the theory of Divisible Abelian Groups, and the stable formulas without parameters in the theory of Real Closed Fields. The third…

Logic · Mathematics 2024-10-24 Daniel Max Hoffmann , Chieu-Minh Tran , Jinhe Ye

In Tensor Field Theory (TFT), observables are defined through tensor field contractions that produce unitary invariants for complex-valued tensor fields. Traditionally, these observables are constructed using tensor fields of a fixed order…

Mathematical Physics · Physics 2025-05-20 Joseph Ben Geloun , Arnauld Solente

We study the question of whether a given regular language of finite trees can be defined in first-order logic. We develop an algebraic approach to address this question and we use it to derive several necessary and sufficient conditions for…

Formal Languages and Automata Theory · Computer Science 2024-07-02 Achim Blumensath

We prove that a valued field of positive characteristic $p$ that has only finitely many distinct Artin-Schreier extensions (which is a property of infinite NTP$_2$ fields) is dense in its perfect hull. As a consequence, it is a deeply…

Commutative Algebra · Mathematics 2021-01-14 Franz-Viktor Kuhlmann

In this paper we provide purely model-theoretic (algebraic) characterisations for classes definable in second-order logic and for pseudo-elementary classes (including PC and PC_{\Delta} classes). Classical results of this flavour include…

Logic · Mathematics 2026-05-12 János Balázs Ivanyos

A complete first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition.…

Logic · Mathematics 2021-02-03 Amador Martin-Pizarro , Martin Ziegler

Similar to a tree grammar, a Horn theory can be used to describe an infinite set of terms. In this paper, we present a class of Horn theories such that the set of definable predicates is closed wrt. conjunction and such that the…

Logic in Computer Science · Computer Science 2014-04-09 Jochen Burghardt

For a representation of a finite group $G$ on a complex vector space $V$ we determine when a holomorphic $\binom{p}{q}$-tensor field on the principle stratum of the orbit space $V/G$ can be lifted to a holomorphic $G$-invariant tensor field…

Differential Geometry · Mathematics 2007-05-23 Andreas Kriegl , Mark Losik , Peter W. Michor

Higher-rank Minkowski valuations are efficient means for describing the geometry and connectivity of spatial patterns. We show how to extend the framework of the scalar Minkowski valuations to vector- and tensor-valued measures. The…

Data Analysis, Statistics and Probability · Physics 2007-05-23 Claus Beisbart , Robert Dahlke , Klaus Mecke , Herbert Wagner

The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…