Computer proofs of limit theorems

DOI10.1016/0004-3702(72)90041-0zbMath0242.68055OpenAlexW2038634728MaRDI QIDQ2554244

W. W. Bledsoe, W. H. Henneman, Robert S. Boyer

Publication date: 1972

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/6191

Mathematics Subject Classification ID

Related Items

A fully automatic theorem prover with human-style output ⋮ Seventy-five problems for testing automatic theorem provers ⋮ MUSCADET: An automatic theorem proving system using knowledge and metaknowledge in mathematics ⋮ Tautology testing with a generalized matrix reduction method ⋮ Knowledge-based proof planning ⋮ Some results on the generalized star-height problem ⋮ A relaxation approach to splitting in an automatic theorem prover ⋮ Computer theorem proving in mathematics ⋮ \(\Pi\)-representation: A clause representation for parallel search ⋮ Constraint solving for proof planning ⋮ Non-resolution theorem proving ⋮ A pragmatic approach to resolution-based theorem proving ⋮ Towards the automation of set theory and its logic ⋮ A man-machine theorem-proving system

Cites Work

• Unnamed Item
• REF-ARF: A system for solving problems stated as procedures
• Splitting and reduction heuristics in automatic theorem proving
• An improved proof procedure1
• A Machine-Oriented Logic Based on the Resolution Principle