Mechanizing Gödel's Incompleteness Theorems and Provability Logic
arXiv:2609.13780
Abstract
We mechanized proof of Gödel's first and second incompleteness theorems, Solovay's arithmetical completeness theorem of \mathbf{GL}, and related results in the Lean 4 theorem prover.
52 pages, 2 figures. Also available the latest version: https://formalizedformallogic.github.io/Mechanizing-Godels-Incompleteness-Theorems-and-Provability-Logic/main.pdf