scientific article; zbMATH DE number 3310921
From MaRDI portal
Publication:5591533
zbMath0195.31102MaRDI QIDQ5591533
Publication date: 1968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Semantics in the theory of computing (68Q55) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Related Items
Formalization of the resolution calculus for first-order logic, Logic applied to integer programming and integer programming applied to logic, Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT., A representation of stably compact spaces, and patch topology., Unnamed Item, Semantic trees revisited: Some new completeness results, Linearity and regularity with negation normal form, Analytic resolution in theorem proving, Mechanizing \(\omega\)-order type theory through unification, Renamable paramodulation for automatic theorem proving with equality, Theorem proving with variable-constrained resolution, A syntactical proof of the Marriage Lemma., Refutational theorem proving using term-rewriting systems
