Extracting the Resolution Algorithm from a Completeness Proof for the Propositional Calculus (Q5434504): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (6 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Robert L. Constable / rank | |||
| Property / author | |||
| Property / author: Robert L. Constable / 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 / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1492881020 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 20:34, 19 March 2024
scientific article; zbMATH DE number 5223569
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extracting the Resolution Algorithm from a Completeness Proof for the Propositional Calculus |
scientific article; zbMATH DE number 5223569 |
Statements
Extracting the Resolution Algorithm from a Completeness Proof for the Propositional Calculus (English)
0 references
4 January 2008
0 references
