We mechanise the undecidability of various frst-order axiom systems in Coq, employing
the synthetic approach to computability underlying the growing Coq Library of Undecidability Proofs. Concretely, we cover both semantic and deductive entailment in fragments
of Peano arithmetic (PA) as well as ZF and related fnitary set theories, with their undecidability established by many-one reductions from solvability of Diophantine equations, i.e.
Hilbert’s tenth problem (H10), and the Post correspondence problem (PCP), respectively.
In the synthetic setting based on the computability of all functions defnable in a constructive foundation, such as Coq’s type theory, it sufces to defne these reductions as metalevel functions with no need for further encoding in a formalised model of computation.
The concrete cases of PA and the considered set theories are supplemented by a general
synthetic theory of undecidable axiomatisations, focusing on well-known connections to
consistency and incompleteness. Specifcally, our reductions rely on the existence of standard models, necessitating additional assumptions in the case of full ZF, and all axiomatic
extensions still justifed by such standard models are shown incomplete. As a by-product of
the undecidability of set theories formulated using only membership and no equality symbol, we obtain the undecidability of frst-order logic with a single binary relation