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

Бүрэн тодорхойлолт

Номзүйн дэлгэрэнгүй

Үндсэн зохиолчид:	Paola Bruscoli, Alessio Guglielmi, Tom Gundersen, Michel Parigot
Формат:	Artigo
Хэл сонгох:	Inglês
Хэвлэсэн:	Logical Methods in Computer Science e.V. 2016-05-01
Цуврал:	Logical Methods in Computer Science
Нөхцлүүд:	computer science - computational complexity computer science - logic in computer science f.4.1 f.2.2
Онлайн хандалт:	https://lmcs.episciences.org/1637/pdf
Шошгууд:	Шошго нэмэх Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!