A mechanised proof of Gödel's incompleteness theorems using Nominal Isabelle (Q286772): Difference between revisions
From MaRDI portal
Created claim: DBLP publication ID (P1635): journals/jar/Paulson15, #quickstatements; #temporary_batch_1731508824982 |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10817-015-9322-8 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10817-015-9322-8 / rank | |||
Normal rank | |||
Latest revision as of 13:28, 9 December 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
0 references
