Journal of Automated Reasoning

, Volume 4, Issue 2, pp 219–231

Automated proofs of Löb's theorem and Gödel's two incompletensess theorems

  • Art Quaife
Problem Corner

DOI: 10.1007/BF00244396

Cite this article as:
Quaife, A. J Autom Reasoning (1988) 4: 219. doi:10.1007/BF00244396


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.

Key words

Automatic reasoning mechanical theorem proving Löb's theorem Gödel's theorem proof verification modal logic 

Copyright information

© Kluwer Academic Publishers 1988

Authors and Affiliations

  • Art Quaife
    • 1
  1. 1.Department of MathematicsUniversity of CaliforniaBerkeleyUSA

Personalised recommendations