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

@@ Property / describes a project that uses @@
+Nuprl
@@ Property / describes a project that uses: Nuprl / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2022840750
@@ Property / OpenAlex ID: W2022840750 / rank @@
+Normal rank
@@ Property / cites work @@
+Model theory
@@ Property / cites work: Model theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q3484381
@@ Property / cites work: Q3484381 / rank @@
+Normal rank
@@ Property / cites work @@
+Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics
+Normal rank
@@ Property / cites work @@
+Q3743300
@@ Property / cites work: Q3743300 / rank @@
+Normal rank
@@ Property / cites work @@
+The Completeness of Propositional Resolution: A Simple and Constructive Proof
+Normal rank
@@ Property / cites work @@
+A Machine-Oriented Logic Based on the Resolution Principle
+Normal rank