Searching for circles of pure proofs
From MaRDI portal
Publication:1904397
DOI10.1007/BF00881802zbMath0838.68101WikidataQ114267040 ScholiaQ114267040MaRDI QIDQ1904397
Publication date: 20 December 1995
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
Shortest axiomatizations of implicational S4 and S5 ⋮ Experiments in the heuristic use of past proof experience ⋮ CODE: A powerful prover for problems of condensed detachment ⋮ Proofs as schemas and their heuristic use ⋮ Larry Wos: visions of automated reasoning
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new use of an automated reasoning assistant: Open questions in equivalential calculus an the study of infinite domains
- Meeting the challenge of fifty years of logic
- Condensed detachment as a rule of inference
- Complexity and related enhancements for automated theorem-proving programs
- A shortest single axiom for the classical equivalential calculus
This page was built for publication: Searching for circles of pure proofs
