Proof Assistant Based on Didactic Considerations

We consider some issues concerning the role of formal logic in software engineering education, which lead us to promote the learning of formal proof through extensive, appropriately guided practice. to this end, we propose to adopt natural deduction as proof system and to make use of an adequate proof assistant to carry out formal proof on machine. we discuss some necessary characteristics of such proof assistant and subsequently present the design and implementation of our own version of it. this incorporates several novel features, such as the display and edition of derivations as trees, the use of meta-theorems (derived rules) as lemmas, and the possibility of maintaining a set of draft trees that can be inserted into the main derivation as needed. the assistant checks the validity of each edition operation as performed. so far, it has been implemented for propositional logic and (quite satisfactorily) put into practice in courses of logic for software engineering and information systems programs.