A mechanised proof of Gödel's incompleteness theorems using Nominal Isabelle (Q286772): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68T15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03F30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03F40 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6585233 / rank
 
Normal rank
Property / zbMATH Keywords
 
Gödel's incompleteness theorems
Property / zbMATH Keywords: Gödel's incompleteness theorems / rank
 
Normal rank
Property / zbMATH Keywords
 
Isabelle/HOL
Property / zbMATH Keywords: Isabelle/HOL / rank
 
Normal rank
Property / zbMATH Keywords
 
nominal syntax
Property / zbMATH Keywords: nominal syntax / rank
 
Normal rank
Property / zbMATH Keywords
 
formalisation of mathematics
Property / zbMATH Keywords: formalisation of mathematics / rank
 
Normal rank

Revision as of 18:49, 27 June 2023

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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references