Theorem-Proving on the Computer
From MaRDI portal
Publication:3847756
DOI10.1145/321160.321166zbMath0109.35603OpenAlexW2040183410MaRDI QIDQ3847756
Publication date: 1963
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321160.321166
Related Items (17)
Problem solving by searching for models with a theorem prover ⋮ Improving the efficiency of a hyperlinking-based theorem prover by incremental evaluation with network structures ⋮ An average case analysis of a resolution principle algorithm in mechanical theorem proving. ⋮ The recursive resolution method for modal logic ⋮ Steps toward a computational metaphysics ⋮ Editor's introduction to Jean van Heijenoort, ``Historical development of modern logic ⋮ Unnamed Item ⋮ Using groups for investigating rewrite systems ⋮ John McCarthy's legacy ⋮ Computer theorem proving in mathematics ⋮ A variant of Herbrand's theorem for formulas in prenex form ⋮ Theorem proving with variable-constrained resolution ⋮ Beweisalgorithmen für die Prädikatenlogik ⋮ A program that computes limits using heuristics to evaluate the indeterminate forms ⋮ The linked conjunct method for automatic deduction and related search techniques ⋮ On proof retrieval: Problem-solving machines, I ⋮ Refutational theorem proving using term-rewriting systems
This page was built for publication: Theorem-Proving on the Computer
