A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Most automated theorem provers su er from the problem that they can produce proofs only in formalisms di cult to understand even for experienced mathematicians. E ort has been made to reconstruct natural deduction (ND) proofs from such machine generated proofs. Although the single steps in ND proofs are easy to understand, the entire proof is usually at a low level of abstraction, containing too many tedious steps. To obtain proofs similar to those found in mathematical textbooks, we propose adoi:10.1007/3-540-58156-1_53 fatcat:b3guvz7gy5agth2pbtnvrmow6q