A Quasipolynomial Cut-Elimination Procedure in Deep Inference via Atomic Flows and Threshold Formulae - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

A Quasipolynomial Cut-Elimination Procedure in Deep Inference via Atomic Flows and Threshold Formulae

Résumé

Jerabek showed in 2008 that cuts in propositional-logic deep inference proofs can be eliminated in quasipolynomial time. The proof is an indirect one relying on a result of Atserias, Galesi and Pudlak about monotone sequent calculus and a correspondence between this system and cut-free deep-inference proofs. In this paper we give a direct proof of Jerabek's result: we give a quasipolynomial-time cut-elimination procedure in propositional-logic deep inference. The main new ingredient is the use of a computational trace of deep-inference proofs called atomic flows, which are both very simple (they trace only structural rules and forget logical rules) and strong enough to faithfully represent the cut-elimination procedure.
Fichier non déposé

Dates et versions

hal-00529320 , version 1 (25-10-2010)

Identifiants

  • HAL Id : hal-00529320 , version 1

Citer

Paola Bruscoli, Alessio Guglielmi, Tom Gundersen, Michel Parigot. A Quasipolynomial Cut-Elimination Procedure in Deep Inference via Atomic Flows and Threshold Formulae. 16th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR-16, 2010, Dakar, Senegal. pp.00-00. ⟨hal-00529320⟩
137 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More