The following pages link to (Q3864488):
Displayed 15 items.
- Grammatical unification (Q789185) (← links)
- Completeness of resolution revisited (Q914411) (← links)
- Condensed detachment as a rule of inference (Q1060210) (← links)
- Completeness results for inequality provers (Q1079960) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- On the relation between default and autoepistemic logic (Q1104771) (← links)
- Relevant logic programming (Q1181715) (← links)
- Implementing the `Fool's model' of combinatory logic (Q1181718) (← links)
- The substitutional framework for sorted deduction: Fundamental results on hybrid reasoning (Q1182164) (← links)
- Gentzen-type systems, resolution and tableaux (Q1311413) (← links)
- Simplification in a satisfiability checker for VLSI applications (Q1312163) (← links)
- Resolution theorem proving in reified modal logics (Q1332644) (← links)
- Solving problems with automated reasoning, expert systems and neural networks (Q1366217) (← links)
- Some remarks on the possibility of extending resolution proof procedures to intuitionistic logic (Q1820590) (← links)
- Frege and the resolution calculus (Q4373015) (← links)