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

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(17 intermediate revisions by 9 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10817-015-9322-8 / rank
Normal rank
 
Property / author
 
Property / author: Lawrence Charles Paulson / rank
Normal rank
 
Property / author
 
Property / author: Lawrence Charles Paulson / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Archive Formal Proofs / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Isabelle/ZF / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Coq / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Isabelle/HOL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Nominal Isabelle / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FinFuns / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Incompleteness Theorems / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56853390 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015224901 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2104.13792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4397069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5667469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5466245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to abstract syntax with variable binding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3244331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Addition and multiplication of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advanced logic for applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Self-verification of HOL Light / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3618853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set theory for verification. I: From foundations to functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem proving in higher order logics. 18th international conference, TPHOLs 2005, Oxford, UK, August 22--25, 2005. Proceedings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set theory. An introduction to independence proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalising FinFuns – Generating Code for Functions as Data from Isabelle/HOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: More Church-Rosser proofs (in Isabelle/HOL) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem Proving in Higher Order Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isabelle/HOL. A proof assistant for higher-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof Pearl: De Bruijn Terms Really Do Work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem Proving in Higher Order Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relative Consistency of the Axiom of Choice Mechanized Using Isabelle⁄zf / rank
 
Normal rank
Property / cites work
 
Property / cites work: A MACHINE-ASSISTED PROOF OF GÖDEL’S INCOMPLETENESS THEOREMS FOR THE THEORY OF HEREDITARILY FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nominal Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metamathematics, Machines and Gödel's Proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite sets and Gödel's incompleteness theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nominal techniques in Isabelle/HOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: General Bindings and Alpha-Equivalence in Nominal Isabelle / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jar/Paulson15 / rank
 
Normal 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
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references