Abstract : We provide a general proof theoretical setting under which the so-called ``completion processes'' (as used for equational reasoning) can be modeled, understood, studied, proved and generalized. This framework---based on a well-founded ordering on proofs---allows us to derive saturation processes and redundancy criteria abstractly.
https://hal.inria.fr/inria-00107627
Contributeur : Publications Loria
<>
Soumis le : jeudi 19 octobre 2006 - 09:03:24
Dernière modification le : jeudi 11 janvier 2018 - 06:19:57
Document(s) archivé(s) le : mercredi 29 mars 2017 - 12:50:16
