Some General Results About Proof Normalization

Marc Aiguier (1) , Longuet Delphine (2)

1 MAS - Mathématiques Appliquées aux Systèmes - EA 4037
2 LRI - Laboratoire de Recherche en Informatique

In this paper, we provide a general setting under which results of normalization of proof trees such as, for instance, the logicality result in equational reasoning and the cut-elimination property in sequent or natural deduction calculi, can be unified and generalized. This is achieved by giving simple conditions which are sufficient to ensure that such normalization results hold, and which can be automatically checked since they are syntactical. These conditions are based on basic properties of elementary combinations of inference rules which ensure that the induced global proof tree transformation processes do terminate.

Mots clés: rewriting; Formal systems; proof tree transformation; weak and strong normalization; cut-elimination; rewriting.

Domaines: Logique en informatique [cs.LO]

Marc Aiguier, Longuet Delphine. Some General Results About Proof Normalization. Logica Universalis, 2010, 4 (1), pp.1-29. ⟨10.1007/s11787-010-0011-4⟩. ⟨hal-00782857⟩