Related papers: Hilbert's tenth problem, G\"odel's incompleteness,…
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…
We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…
In this article, we explore the notion of infinity by studying Cantor's contribution to this field. A brief history of set theory is given. As an example of infinity, we consider Hilbert's famous hotel. A graphical construction is used to…
Ufnarovski remarked in 1990 that it is unknown whether any finitely presented associative algebra of linear growth is automaton, that is, whether the set of normal words in the algebra form a regular language. If the algebra is graded, then…
This paper concerns a long-standing problem raised by Beurling and Wintner on completeness of the dilation system $\{\varphi(kx):k=1,2,\cdots\}$ generated by the odd periodic extension on $\mathbb{R}$ of any $\varphi\in L^2[0,1]$. Up to now…
G{\"o}del's second incompleteness theorem forbids to prove, in a given theory U, the consistency of many theories-in particular, of the theory U itself-as well as it forbids to prove the normalization property for these theories, since this…
What if the paradoxical nature of quantum theory could find its source in some undecidability analog to that of G\"odel's incompleteness theorem ? This essay aims at arguing for such G\"odelian hunch via two case studies. Firstly, using a…
Let f(t,X) be an irreducible polynomial over the field of rational functions k(t), where k is a number field. Let O be the ring of integers of k. Hilbert's irreducibility theorem gives infinitely many integral specializations of t to values…
We study the Borel-reducibility of isomorphism relations of complete first order theories and show the consistency of the following: For all such theories T and T', if T is classifiable and T' is not, then the isomorphism of models of T' is…
This paper talk about the complexity of computation by Turing Machine. I take attention to the relation of symmetry and order structure of the data, and I think about the limitation of computation time. First, I make general problem named…
Consider the semisimple mod p reduction of the Galois representation associated to a Hilbert newform f by Carayol and Taylor. This paper discusses how, under certain conditions on f, the universal ring for deformations of this residual…
In this note we observe that automated theorem provers (ATPs) that recursively enumerate theorems in a particular way will fail to identify some valid theorems for a reason that is analogous to how G\"odel proved the existence of what are…
We study systems of polynomial equations in infinite finitely generated commutative associative rings with an identity element. For each such ring $R$ we obtain an interpretation by systems of equations of a ring of integers $O$ of a finite…
These five lectures on undecidability were given to students with a good level in mathematics but with no special knowledge on logic. The first conference presents the formalization of mathematics with a short historical survey, the…
We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. The resulting computability theory leads to a notion of…
The First and Second Liouville's Theorems provide correspondingly criterium for integrability of elementary functions "in finite terms" and criterium for solvability of second order linear differential equations by quadratures. The…
We show that for $5/6$-th of all primes $p$, Hilbert's 10-th Problem is unsolvable for $\mathbb{Q}(\zeta_3, \sqrt[3]{p})$. We also show that there is an infinite set $S$ of square free integers such tha Hilbert's 10-th Problem is unsolvable…
We construct a topos in which the Dedekind reals are countable. The topos arises from a new kind of realizability, which we call parameterized realizability, based on partial combinatory algebras whose application depends on a parameter.…
A semantic analysis of formal systems is undertaken, wherein the duality of their symbolic definition based on the "State of Doing" and "State of Being" is brought out. We demonstrate that when these states are defined in a way that opposes…
The investigations on higher-order type theories and on the related notion of parametric polymorphism constitute the technical counterpart of the old foundational problem of the circularity (or impredicativity) of second and higher order…