Extracting the resolution algorithm from a completeness proof for the propositional calculus (Q636273): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(9 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Robert L. Constable / rank
Normal rank
 
Property / author
 
Property / author: Robert L. Constable / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SATCHMO / 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: Haskell / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Nuprl / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2022840750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3484381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3743300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Completeness of Propositional Resolution: A Simple and Constructive Proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:46, 4 July 2024

scientific article
Language Label Description Also known as
English
Extracting the resolution algorithm from a completeness proof for the propositional calculus
scientific article

    Statements

    Extracting the resolution algorithm from a completeness proof for the propositional calculus (English)
    0 references
    26 August 2011
    0 references
    type theory
    0 references
    resolution
    0 references
    program extraction
    0 references
    automated reasoning
    0 references
    intuitionism
    0 references
    Coq
    0 references
    Haskell program
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers