Extracting the resolution algorithm from a completeness proof for the propositional calculus (Q636273): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Nuprl / rank | |||
Normal rank | |||
Revision as of 09:02, 28 February 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
