arXiv (OAI Expanded)
open access
Mechanizing Gödel's Incompleteness Theorems and Provability Logic
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.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Current Research on Gödel’s Incompleteness Theorems#696456
- On the Depth of Gödel’s Incompleteness Theorems#86932
- On the philosophical relevance of Gödel's incompleteness theorems#762148
- Indiscernibles and satisfaction classes in arithmetic#986068
- Mathematical instrumentalism, Gödel’s theorem, and inductive evidence#106977
Record · ID 1110368
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive