2 papers
cs.LO2025
A Formal Proof of Complexity Bounds on Diophantine Equations
Jonas Bayer, Marco David
We present a universal construction of Diophantine equations with bounded complexity in Isabelle/HOL. This is a formalization of our own work in number theory. Hilbert's Tenth Prob…
math.NT2025
Diophantine Equations over : Universal Bounds and Parallel Formalization
Jonas Bayer, Marco David, Malte Hassler +2
This paper explores multiple closely related themes: bounding the complexity of Diophantine equations over the integers and developing mathematical proofs in parallel with formal t…