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...

Celý popis

Podrobná bibliografie

Hlavní autoři:	Paola Bruscoli, Alessio Guglielmi, Tom Gundersen, Michel Parigot
Médium:	Artigo
Jazyk:	Inglês
Vydáno:	Logical Methods in Computer Science e.V. 2016-05-01
Edice:	Logical Methods in Computer Science
Témata:	computer science - computational complexity computer science - logic in computer science f.4.1 f.2.2
On-line přístup:	https://lmcs.episciences.org/1637/pdf
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!