Lean 4 Mechanization about Provability Logics
-
Updated
Sep 22, 2026 - Lean
Lean 4 Mechanization about Provability Logics
Lean 4 formalization of a modal-axiomatic Gödel-Löb provability-logic substrate and Löb's theorem.
Gödel-Kleene, Rosser, and Chaitin incompleteness, second incompleteness theorem, Löb's theorem, and Solovay's theorem (GL is the provability logic), for Lean's type theory. Proved in Lean 4 over lean4lean's formal typing judgment. LLM-assisted, unaudited by experts.
Parser and prover/solver for provability logics (GL, iGL, etc.)
To associate your repository with the provability-logic topic, visit your repo's landing page and select "manage topics."