Some General Results About Proof Normalization - CentraleSupélec Access content directly
Journal Articles Logica Universalis Year : 2010

Some General Results About Proof Normalization

Longuet Delphine


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.
Fichier principal
Vignette du fichier
Logica-Universalis10.pdf (270.07 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-00782857 , version 1 (30-01-2013)



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⟩
131 View
238 Download



Gmail Facebook X LinkedIn More