Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae

DOI10.2168/LMCS-12(2:5)2016zbMath1448.03045MaRDI QIDQ5739889

Michel Parigot, Paola Bruscoli, Alessio Guglielmi, Tom Gundersen

Publication date: 6 July 2016

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

zbMATH Keywords

proof theorythreshold functionsproof complexitydeep inference

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Complexity of proofs (03F20)

Related Items (2)

A Subatomic Proof System for Decision Trees ⋮ On the Proof Complexity of Cut-Free Bounded Deep Inference

This page was built for publication: Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae