A Mechanised Proof of Gödel’s Incompleteness Theorems using Nominal Isabelle Lawrence C. Paulson Abstract An Isabelle/HOL formalisation of Gödel’s two incompleteness theorems is presented. The work follows Świerczkowski’s detailed proof of the theorems using hered- itarily finite (HF) set theory [32]. Avoiding the usual arithmetical encodings of syntax eliminates the necessity to formalise elem

