A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Abstract: "Natural deduction (for short: nd-) calculi have not been used systematically as a basis for automated theorem proving in classical logic. To remove objective obstacles to their use I describe (1) a method that allows to give semantic proofs of normal form theorems for nd-calculi and (2) a framework that allows to search directly for normal nd-proofs. Thus one can try to answer the question: How do we bridge the gap between claims and assumptions in heuristically motivated ways? Thisdoi:10.1184/r1/6492017.v1 fatcat:4bijnqwfzndphd3j3tte5r2bhe