The following pages link to (Q5339307):
Displaying 16 items.
- On connections and higher-order logic (Q908896) (← links)
- A decidable fragment of predicate calculus (Q1066880) (← links)
- One modification of the ordering strategy in the resolution method (Q1115411) (← links)
- Unification theory (Q1124375) (← links)
- Using rewriting rules for connection graphs to prove theorems (Q1137877) (← links)
- A comparative study of several proof procedures (Q1836483) (← links)
- The linked conjunct method for automatic deduction and related search techniques (Q1836998) (← links)
- The unit-clause proof procedure with equality (Q2547127) (← links)
- Theorem proving with variable-constrained resolution (Q2554609) (← links)
- Beweisalgorithmen für die Prädikatenlogik (Q2558006) (← links)
- My Life as a Logician (Q3305314) (← links)
- Banishing Ultrafilters from Our Consciousness (Q3305324) (← links)
- History and Prospects for First-Order Automated Deduction (Q3454079) (← links)
- Representations of the language recognition problem for a theorem prover (Q4770508) (← links)
- The Strategy Challenge in SMT Solving (Q4913859) (← links)
- Seventy Years of Computer Science (Q5049043) (← links)