A mechanised proof of Gödel's incompleteness theorems using Nominal Isabelle (Q286772): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: FinFuns / rank | |||
Normal rank |
Revision as of 22:05, 28 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A mechanised proof of Gödel's incompleteness theorems using Nominal Isabelle |
scientific article |
Statements
A mechanised proof of Gödel's incompleteness theorems using Nominal Isabelle (English)
0 references
26 May 2016
0 references
Gödel's incompleteness theorems
0 references
Isabelle/HOL
0 references
nominal syntax
0 references
formalisation of mathematics
0 references