Automated proofs of Löb's theorem and Gödel's two incompletensess theorems
- Cite this article as:
- Quaife, A. J Autom Reasoning (1988) 4: 219. doi:10.1007/BF00244396
- 26 Downloads
The modal logic calculus K4, which represents important properties of the provability relation of Peano's Arithmetic, is formalized within the automated reasoning system ITP. Very high level automated proofs are then obtained of Löb's theorem, and of Gödel's two incompleteness theorems.