Related papers: Relative decidability and definability in henselia…
We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…
A new characterization of provably recursive functions of first-order arithmetic is described. Its main feature is using only terms consisting of 0, the successor S and variables in the quantifier rules, namely, universal elimination and…
We investigate fields of characteristic 0 and dp-rank 2. While we do not obtain a classification, we prove that any unstable field of characteristic 0 and dp-rank 2 admits a unique definable V-topology. If this statement could be…
Let $\mathcal F=(F, +. \cdot, <, 0, 1, \dots)$ be a definably complete locally o-minimal expansion of an ordered field. We demonstrate the existence of definable quotients of definable sets by definable equivalence relations when several…
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…
In this paper we give a detailed analysis of deterministic and randomized algorithms that enumerate any number of irreducible polynomials of degree $n$ over a finite field and their roots in the extension field in quasilinear where $N=n^2$…
The definition of a quantum system requires a Hilbert space, a way to define the dynamics, and an algebra of observables. The structure of the observable algebra is related to a tensor product decomposition of the Hilbert space and…
In the paper, notions of relative separability for hypergraphs of models of a theory are defined. Properties of these notions and applications to ordered theories are studied: characterizations of relative separability both in a general…
When voter preferences are known in an incomplete (partial) manner, winner determination is commonly treated as the identification of the necessary and possible winners; these are the candidates who win in all completions or at least one…
We construct irreducible unitary representations of a finitely generated free group which are weakly contained in the left regular representation and in which a given linear combination of the generators has an eigenvalue. When the…
We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…
We consider recognizable evaluations for a suitable category of oriented two-dimensional cobordisms with corners between finite unions of intervals. We call such cobordisms thin flat surfaces. An evaluation is given by a power series in two…
We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and…
We prove that the finiteness of a finitely generated category of irreducible algebraic varieties over a field of characteristic zero is decidable. We also obtain a Burnside finiteness criterion for such a category, with applications to…
We generalize the concept of a number derivative, and examine one particular instance of a deformed number derivative for finite field elements. We find that the derivative is linear when the deformation is a Frobenius map and go on to…
An expansion of a definably complete field either defines a discrete subring, or the image of a definable discrete set under a definable map is nowhere dense. As an application we show a definable version of Lebesgue's differentiation…
If F is a type-definable family of commensurable subsets, subgroups or sub-vector spaces in a metric structure, then there is an invariant subset, subgroup or sub-vector space commensurable with F. This in particular applies to…
The integral of a function $f$ defined on a symmetric space $M \simeq G/K$ may be expressed in the form of a determinant (or Pfaffian), when $f$ is $K$-invariant and, in a certain sense, a tensor power of a positive function of a single…
We give a brief report on our computations of linear determinantal representations of smooth plane cubics over finite fields. After recalling a classical interpretation of linear determinantal representations as rational points on the…
We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…