Lecturas_GLC
Lecturas del Grupo de Lógica Computacional
view repo
We formalise the undecidability of solvability of Diophantine equations, i.e. polynomial equations over natural numbers, in Coq's constructive type theory. To do so, we give the first full mechanisation of the Davis-Putnam-Robinson-Matiyasevich theorem, stating that every recursively enumerable problem – in our case by a Minsky machine – is Diophantine. We obtain an elegant and comprehensible proof by using a synthetic approach to computability and by introducing Conway's FRACTRAN language as intermediate layer. Additionally, we prove the reverse direction and show that every Diophantine relation is recognisable by μ-recursive functions and give a certified compiler from μ-recursive functions to Minsky machines.
READ FULL TEXT
We present a formalization of the foundations of computability theory in...
read it
This paper proposes a totally constructive approach for the proof of
Hil...
read it
We define a class of computable functions over real numbers using functi...
read it
Guided by Tarksi's fixpoint theorem in order theory, we show how to deri...
read it
Hilbert's Foundations of Geometry was perhaps one of the most influentia...
read it
We study finite first-order satisfiability (FSAT) in the constructive se...
read it
Cubical type theory provides a constructive justification of homotopy ty...
read it
Lecturas del Grupo de Lógica Computacional
Comments
There are no comments yet.