Pages that link to "Item:Q636273"
From MaRDI portal
The following pages link to Extracting the resolution algorithm from a completeness proof for the propositional calculus (Q636273):
Displaying 5 items.
- Completeness in PVS of a nominal unification algorithm (Q1744405) (← links)
- On compatibilities of \(\alpha \)-lock resolution method in linguistic truth-valued lattice-valued logic (Q1933772) (← links)
- Extracting a DPLL Algorithm (Q3178287) (← links)
- Completeness of Resolution for Definite Answers (Q4847378) (← links)
- Formalizing Bachmair and Ganzinger's ordered resolution prover (Q5916290) (← links)