Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae

Je\v{r}\'abek showed that cuts in classical propositional logic proofs in deep inference can be eliminated in quasipolynomial time. The proof is indirect and it relies on a result of Atserias, Galesi and Pudl\'ak about monotone sequent calculus and a correspondence between that system and cut-free d...

Description complète

Détails bibliographiques

Auteurs principaux:	Paola Bruscoli, Alessio Guglielmi, Tom Gundersen, Michel Parigot
Format:	Artigo
Langue:	Inglês
Publié:	Logical Methods in Computer Science e.V. 2016-05-01
Collection:	Logical Methods in Computer Science
Sujets:	computer science - computational complexity computer science - logic in computer science f.4.1 f.2.2
Accès en ligne:	https://lmcs.episciences.org/1637/pdf
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!