A Mechanised Proof of Gödel’s Incompleteness Theorems Using Nominal Isabelle

An Isabelle/HOL formalisation of Gödel’s two incompleteness theorems is presented. The work follows Świerczkowski’s detailed proof of the theorems using hereditarily finite (HF) set theory (Dissertationes Mathematicae 422 , 1–58, 2003 ). Avoiding the usual arithmetical encodings of syntax eliminates...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of automated reasoning Vol. 55; no. 1; pp. 1 - 37
Main Author:	Paulson, Lawrence C.
Format:	Journal Article
Language:	English
Published:	Dordrecht Springer Netherlands 01.06.2015 Springer Nature B.V
Subjects:	Artificial Intelligence Computer Science Mathematical Logic and Formal Languages Mathematical Logic and Foundations Symbolic and Algebraic Manipulation Isabelle/HOL Nominal syntax Gödel’s incompleteness theorems Formalisation of mathematics
ISSN:	0168-7433, 1573-0670
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!