Methods of Lemma Extraction in Natural Deduction Proofs
The existing examples of natural deduction proofs, either declarative or procedural, indicate that often the legibility of proof scripts is of secondary importance to the authors. As soon as the computer accepts the proof script, many authors do not work on improving the parts that could be shortened and do not avoid repetitions of technical sub-deductions, which often could be replaced by a single lemma. This article presents selected properties of reasoning passages that may be used to determine if a reasoning passage can be extracted from a proof script, transformed into a lemma and replaced by a reference to the newly created lemma. Additionally, we present methods for improving the legibility of the reasoning that remains after the extraction of the lemmas.
lemma extraction natural deduction legibility