Related papers: Hilbert's tenth problem, G\"odel's incompleteness,…
A rather easy yet rigorous proof of a version of G\"odel's first incompleteness theorem is presented. The version is "each recursively enumerable theory of natural numbers with 0, 1, +, *, =, logical and, logical not, and the universal…
Hilbert's Tenth Problem (H10) for a ring R asks for an algorithm to decide correctly, for each $f\in\mathbb{Z}[X_{1},\dots,X_{n}]$, whether the diophantine equation $f(X_{1},...,X_{n})=0$ has a solution in R. The celebrated…
G\"odel's second incompleteness theorem is standardly understood as showing that no sufficiently strong, consistent theory of arithmetic can prove its own consistency, a result typically interpreted against a model-theoretic background in…
Inspired by Quantum Mechanics, we reformulate Hilbert's tenth problem in the domain of integer arithmetics into either a problem involving a set of infinitely coupled differential equations or a problem involving a Shr\"odinger propagator…
For each Turing machine T, we construct an algebra A'(T) such that the variety generated by A'(T) has definable principal subcongruences if and only if T halts, thus proving that the property of having definable principal subcongruences is…
This lectures notes consists of four lectures. The first lecture discusses questions around Hilbert-Arnold Problem which is naturally arises from Quantitative Hilbert 16-th problem. In the second lecture we outline author's solution of a…
This paper explores multiple closely related themes: bounding the complexity of Diophantine equations over the integers and developing mathematical proofs in parallel with formal theorem provers. Hilbert's Tenth Problem (H10) asks about the…
We prove a negative solution to the analogue of Hilbert's tenth problem for rings of one variable non-Archimedean entire functions in any characteristic. In the positive characteristic case we prove more: the ring of rational integers is…
In this paper, we provide a fairly general self-reference-free proof of the Second Incompleteness Theorem from Tarski's Theorem of the Undefinability of Truth.
We prove, for stably computably enumerable formal systems, direct analogues of the first and second incompleteness theorems of G\"odel. A typical stably computably enumerable set is the set of Diophantine equations with no integer…
The 20th century has revealed two important limitations of scientific knowledge. On the one hand, the combination of Poincar\'e's nonlinear dynamics and Heisenberg's uncertainty principle leads to a world picture where physical reality is,…
Hilbert's 14th Problem asks the following question. Given a linear representation $ \beta: G \to \operatorname{GL}(\mathbf{V}) $ of a linear algebraic group over a field $ k $ is the ring $ S_{k}(\mathbf{V}^{\ast}) $ a finitely generated $…
One of the main open problems in the context of extensions of Hilbert's tenth problem (HTP) is the case of the ring of complex entire functions in one variable. Our main result provides a step towards an answer: For every $\rho\ge 0$, we…
It has been shown that quantum paradoxes have followed from one special assumption, i.e., from attributing basic physical meaning to Hamiltonian eigenfunctions and representing all physical states by vectors of the Hilbert space spanned on…
We give a precise definition of a formal mathematical object as any symbol for an individual constant, predicate letter, or a function letter that can be introduced through definition into a formal mathematical language without inviting…
The definition of \NP\ requires, for each member language~$L$, a polynomial-time checking relation~$R$ and a constant~$k$ such that $w \in L \iff \exists y\,(|y| \leq |w|^k \wedge R(w,y))$. We show that this biconditional instantiates, for…
In [arXiv:1405.6274, Question 5.2 & Question 5.3] Aschenbrenner, Friedl and Wilton ask: (1) Is the equation problem solvable for the fundamental group of any $3$-manifold? and (2) Is the first-order theory of the fundamental group of any…
We introduce a new criterion which tests if a given decomposition of a given ternary form $T$ of even degree is unique. The criterion is based on the analysis of the Hilbert function of the projective set of points $Z$ associated to the…
Incomputability results in Formal Logic and the Theory of Computation (i.e., incompleteness and undecidability) have deep implications for the foundations of mathematics and computer science. Likewise, Social Choice Theory, a branch of…
For Hilbert, the consistency of a formal theory T is an infinite series of statements "D is free of contradictions" for each derivation D and a consistency proof is i) an operation that, given D, yields a proof that D is free of…