A Mechanised Proof of Gödel’s Incompleteness Theorems Using Nominal Isabelle
- Submitting institution
-
University of Cambridge
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1849
- Type
- D - Journal article
- DOI
-
10.1007/s10817-015-9322-8
- Title of journal
- Journal of Automated Reasoning
- Article number
- 1
- First page
- 1
- Volume
- 55
- Issue
- 1
- ISSN
- 0168-7433
- Open access status
- Out of scope for open access requirements
- Month of publication
- April
- Year of publication
- 2015
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
0
- Research group(s)
-
-
- Citation count
- 9
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The paper reports the first ever formalisation of Gödel's second incompleteness theorem, an achievement that the community had not expected. It is likely to have been a significant factor in the author's election to the Royal Society in 2017. In the same year, he also received the Herbrand Award for Distinguished Contributions to Automated Reasoning; the citation specifically refers to "his impressive formalizations of deep mathematical theories".
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -