About Folding-Unfolding Cuts and Cuts Modulo

Rapport Année : 2000

(1)

Gilles Dowek

Logic and computing

We show in this note that cut elimination in deduction modulo subsumes cut elimination in deduction with the folding and unfolding rules.

CUT ELIMINATION DEDUCTION MODULO FOLDING UNFOLDING

Autre [cs.OH]

Fichier principal

RR-4004.pdf (199.41 Ko)

https://inria.hal.science/inria-00072640

Soumis le : mercredi 24 mai 2006-10:28:26

Dernière modification le : vendredi 24 mars 2023-14:52:47

Archivage à long terme le : dimanche 4 avril 2010-23:16:36

inria-00072640 , version 1 (24-05-2006)

Gilles Dowek. About Folding-Unfolding Cuts and Cuts Modulo. RR-4004, INRIA. 2000. ⟨inria-00072640⟩

X EC-PARIS CNRS INRIA INRIA-RRRT UMR8623 INRIA2 LARA UNIV-PARIS-SACLAY

147 Consultations

165 Téléchargements