Related papers: Defining $\mathbb{Z}$ in $\mathbb{Q}$
We produce new examples of totally imaginary infinite extensions of $\mathbb{Q}$ which have undecidable first-order theory by generalizing the methods used by Martinez-Ranero, Utreras and Videla for $\mathbb{Q}^{(2)}$. In particular, we use…
The first of the two related papers analising and explaining the origin, manifestations and parodoxical features of the quantum potential (QP) from the non-relativistic and relativistic point of view. QP arises in the quantum Hamiltonian,…
The ring of finite ad\`eles $\Af$ of the rational numbers $\Q$ is obtained in this article as a completion of $\Q$ with respect to a certain non--Archimedean metric. This ultrametric allows to represent any finite ad\`ele as a series…
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…
We classify finite groups $G$, such that the group algebra, $\mathbb{Q}G$ (over the field of rational numbers $\mathbb{Q}$), is the direct product of the group algebra $\mathbb{Q}[G/N]$ of a proper factor group $G/N$, and some division…
This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…
In this paper, I first establish -- via methods other than the Gottesman-Knill theorem -- the existence of an infinite set of instances of simulating a quantum circuit to decide a decision problem that can be simulated classically. I then…
We show that Zilber's conjecture that complex exponentiation is isomorphic to his pseudo-exponentiation follows from the a priori simpler conjecture that they are elementarily equivalent. An analysis of the first-order types in…
We present a formulation of quantum circuits where the focus is set on whether a given circuit (made of unitary operators and projective measurements with definite outcomes) does reflect an actually realizable physical experiment. In order…
Precise rules are developed in order to formalize the reasoning processes involved in standard non-relativistic quantum mechanics, with the help of analogies from classical physics. A classical or quantum description of a mechanical system…
Based on the works of M. Marshall on multirings, we propose the fundamentals for a \textbf{non reduced} abstract quadratic forms theory in general coefficients on rings, with the machinery of multirings and multifields.
We show that if a universal quadratic form exists over an infinite degree, totally real extension of the field of rationals $\mathbb{Q}$, then the set of totally positive integers in the extension does not have the Northcott property. In…
For any first order theory T we construct a Boolean valued model M, in which precisely the T--provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order…
Let $\mathcal{R}$ be a finite valuation ring of order $q^r$. In this paper we generalize and improve several well-known results, which were studied over finite fields $\mathbb{F}_q$ and finite cyclic rings $\mathbb{Z}/p^r\mathbb{Z}$, in the…
We define for real $q$ a unital $*$-algebra $U_q(\mathfrak{sl}(2,\mathbb{R}))$ quantizing the universal enveloping $*$-algebra of $\mathfrak{sl}(2,\mathbb{R})$. The $*$-algebra $U_q(\mathfrak{sl}(2,\mathbb{R}))$ is realized as a…
We construct, for every integer $N\in\mathbb{N}^*$, a structure whose Grothendieck ring is isomorphic to $(\mathbb{Z}/N\mathbb{Z})[X]$, thus proving the existence of structures with a non-zero Grothendieck ring with non-zero characteristic.…
The ordered structures of natural, integer, rational and real numbers are studied in this thesis. The theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language of order…
We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…
This paper is devoted to analize inside the infinitely many possible bases of Uq(g), same that can be considered "more equal then others". The element of selection has been a privileged relation with the bialgebra. A new parameter z' has…
We prove a universal recursive formulas for Branson's $Q$-curvature of order eight in terms of lower-order $Q$-curvatures, lower-order GJMS-operators and holographic coefficients. The results prove a special case of a conjecture in…