Programming and verifying a declarative first-order prover in Isabelle/HOL (Q5145439): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(12 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Isabelle/jEdit / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GitHub / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Completeness theorem / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Superposition Calculus / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Isabelle / 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: Sledgehammer / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Metamath / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FOL Fitting / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Verified Prover / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending Sledgehammer with SMT Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Soundness and completeness proofs by coinductive methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visual Theorem Proving with the Incredible Proof Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3235339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof assistants: history, ideas and future / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edinburgh LCF. A mechanized logic of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Code Generation via Higher-Order Rewrite Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751354 / 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: Q4619818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-formalisation of higher-order logic. Semantics, soundness, and a verified implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Write a Proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to write a 21\(^{\text{st}}\) century proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem Proving in Higher Order Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124795 / 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: A mechanised proof of Gödel's incompleteness theorems using Nominal Isabelle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Seventy-five problems for testing automatic theorem provers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalization of the Resolution Calculus for First-Order Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Gödel Completeness Theorem for Uncountable Languages / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3233/aic-180764 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2797950816 / rank
 
Normal rank

Latest revision as of 10:26, 30 July 2024

scientific article; zbMATH DE number 7298903
Language Label Description Also known as
English
Programming and verifying a declarative first-order prover in Isabelle/HOL
scientific article; zbMATH DE number 7298903

    Statements

    Programming and verifying a declarative first-order prover in Isabelle/HOL (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 January 2021
    0 references
    0 references
    Isabelle
    0 references
    verification
    0 references
    declarative proofs for first-order logic with equality
    0 references
    soundness
    0 references
    LCF-style prover
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references