Skip to main content
×
Home
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 2
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Gordon, M. J. C. 2015. Tactics for mechanized reasoning: a commentary on Milner (1984) 'The use of machines to assist in rigorous proof'. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, Vol. 373, Issue. 2039, p. 20140234.


    Paulson, Lawrence C. 2015. A Mechanised Proof of Gödel’s Incompleteness Theorems Using Nominal Isabelle. Journal of Automated Reasoning, Vol. 55, Issue. 1, p. 1.


    ×

A MACHINE-ASSISTED PROOF OF GÖDEL’S INCOMPLETENESS THEOREMS FOR THE THEORY OF HEREDITARILY FINITE SETS

  • LAWRENCE C. PAULSON (a1)
  • DOI: http://dx.doi.org/10.1017/S1755020314000112
  • Published online: 03 April 2014
Abstract
Abstract

A formalization of Gödel’s incompleteness theorems using the Isabelle proof assistant is described. This is apparently the first mechanical verification of the second incompleteness theorem. The work closely follows Świerczkowski (2003), who gave a detailed proof using hereditarily finite set theory. The adoption of this theory is generally beneficial, but it poses certain technical issues that do not arise for Peano arithmetic. The formalization itself should be useful to logicians, particularly concerning the second incompleteness theorem, where existing proofs are lacking in detail.

Copyright
Corresponding author
*COMPUTER LABORATORY UNIVERSITY OF CAMBRIDGE CAMBRIDGE, CB3 0FD, UK E-mail: lp15@cam.ac.uk
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

T Franzén . (2005). Gödel’s Theorem: An Incomplete Guide to Its Use and Abuse. Wellesley, Mass: A K Peters.

L Kirby . (2007). Addition and multiplication of sets. Mathematical Logic Quarterly,53(1), 5265.

T. Nipkow , L. C. Paulson , & M Wenzel . (2002). Isabelle/HOL: A Proof Assistant for Higher-Order Logic. Lecture Notes in Computer Science vol. 2283, Berlin: Springer.

N Shankar . (1994). Metamathematics, Machines, and Gödel’s Proof. Cambridge : Cambridge University Press.

S Świerczkowski . (2003). Finite sets and Gödel’s incompleteness theorems. Dissertationes Mathematicae, 422, 158. Available from: http://journals.impan.gov.pl/dm/Inf/422-0-1.html.

C. Urban , & C Kaliszyk . (2012). General bindings and alpha-equivalence in Nominal Isabelle. Logical Methods in Computer Science, 8(2:14), 135.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Review of Symbolic Logic
  • ISSN: 1755-0203
  • EISSN: 1755-0211
  • URL: /core/journals/review-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×