The following pages link to Theorem-Proving on the Computer (Q3847756):
Displaying 18 items.
- John McCarthy's legacy (Q543573) (← links)
- Computer theorem proving in mathematics (Q704001) (← links)
- Refutational theorem proving using term-rewriting systems (Q802317) (← links)
- Steps toward a computational metaphysics (Q877243) (← links)
- The recursive resolution method for modal logic (Q1104915) (← links)
- Problem solving by searching for models with a theorem prover (Q1337680) (← links)
- Improving the efficiency of a hyperlinking-based theorem prover by incremental evaluation with network structures (Q1340966) (← links)
- An average case analysis of a resolution principle algorithm in mechanical theorem proving. (Q1353997) (← links)
- The linked conjunct method for automatic deduction and related search techniques (Q1836998) (← links)
- Editor's introduction to Jean van Heijenoort, ``Historical development of modern logic'' (Q1942090) (← links)
- Theorem proving with variable-constrained resolution (Q2554609) (← links)
- Beweisalgorithmen für die Prädikatenlogik (Q2558006) (← links)
- A program that computes limits using heuristics to evaluate the indeterminate forms (Q2562568) (← links)
- Using groups for investigating rewrite systems (Q3545275) (← links)
- A variant of Herbrand's theorem for formulas in prenex form (Q3912069) (← links)
- (Q4770509) (← links)
- On proof retrieval: Problem-solving machines, I (Q5514842) (← links)
- Fully reusing clause deduction algorithm based on standard contradiction separation rule (Q6492544) (← links)
