Related papers: A definable henselian valuation with high quantifi…

We prove that definable ring topologies on NIP fields are closely connected to NIP integral domains. More precisely, we show that up to elementary equivalence, any NIP topological field arises from an NIP integral domain. As an application,…

The classical work of Feferman Vaught gives a powerful, constructive analysis of definability in (generalized) product structures, and certain associated enriched Boolean structures. %structures in terms of definability in the component…

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…

Let K be a field with a valuation satisfying the following conditions: both K and the residue field k have characteristic zero; the value group is not 2-divisible; there exists a maximal subfield F in the valuation ring such that…

Let K be a field. For a given valuation on K[x], we determine the structure of its graded algebra and describe its set of key polynomials, in terms of any given key polynomial of minimal degree. We also characterize valuations not admitting…

We develop a notion of a `canonical $\mathcal{C}$-henselian valuation' for a class $\mathcal{C}$ of field extensions, generalizing the construction of the canonical henselian valuation of a field. We use this to show that the $p$-adic…

Let A and B be integral domains. Suppose A is Noetherian and B is a finitely generated A-algebra that contains A. Denote by A' the integral closure of A in B. We show that A' is determined by finitely many unique discrete valuation rings.…

Let $\mathcal{X}$ be a skeletally small additive category. Using the canonical equivalence between two different presentations of the free abelian category over $\mathcal{X}$, we give a new and simple characterization of definable…

In this article we formally define and investigate the computational complexity of the Definability Problem for open first-order formulas (i.e., quantifier free first-order formulas) with equality. Given a logic $\mathbf{\mathcal{L}}$, the…

The Fourier transform is naturally defined for integrable functrions. Otherwise, it should be stipulated in which sense the Fourier transform is understood. We consider some class of radial and, generally saying, nonintegrable functions.…

We show how suitable extensions $(L|K,v)$ of prime degree of valued fields give rise to definable coarsenings of the valuation rings of $L$ and $K$. In the case of Artin-Schreier and Kummer extensions with wild ramification, we can also…

Let $p$ be a prime number and let $F$ be a field containing a root of unity of order $p$. We prove that a certain very small canonical Galois group $(G_F)_{[3]}$ over $F$ encodes the valuations on $F$ whose value group is not $p$-divisible…

In this paper we propose a general approach to define a many-valued preferential interpretation of gradual argumentation semantics. The approach allows for conditional reasoning over arguments and boolean combination of arguments, with…

There is a model of ZF with a $\Delta^1_3$ definable Hamel basis in which $AC_\omega(R)$ fails.

One of the main open problems regarding decidability of the existential theory of rings is the analogue of Hilbert's Tenth Problem (HTP) for the ring of entire holomorphic functions in one variable. In the direction of a negative solution,…

In resolving instances of a computational problem, if multiple instances of interest share a feature in common, it may be fruitful to compile this feature into a format that allows for more efficient resolution, even if the compilation is…

We give a mathematical framework for manipulating indeterminate-length quantum bit strings. In particular, we define prefixes, fragments, tensor products and concatenation of such strings of qubits, and study their properties and…

In this paper, we show that a partitioned formula \phi is dependent if and only if \phi has uniform definability of types over finite partial order indiscernibles. This generalizes our result from a previous paper [1]. We show this by…

Functional Distributional Semantics provides a computationally tractable framework for learning truth-conditional semantics from a corpus. Previous work in this framework has provided a probabilistic version of first-order logic, recasting…

This paper characterizes the quasilocal fields from the class of Henselian valued fields with totally indivisible value groups, which possess finite separable extensions of nontrivial defect. We show that, for any prime number $q$, a…