TY - CHAP
T1 - Complexity of deep inference via atomic flows
AU - Das, A.
PY - 2012
Y1 - 2012
N2 - We consider the fragment of deep inference free of compression mechanisms and compare its proof complexity to other systems, utilising 'atomic flows' to examine size of proofs. Results include a simulation of Resolution and dag-like cut-free Gentzen, as well as a separation from bounded-depth Frege.
AB - We consider the fragment of deep inference free of compression mechanisms and compare its proof complexity to other systems, utilising 'atomic flows' to examine size of proofs. Results include a simulation of Resolution and dag-like cut-free Gentzen, as well as a separation from bounded-depth Frege.
UR - http://dx.doi.org/10.1007/978-3-642-30870-3_15
UR - https://www.scopus.com/pages/publications/84862222493
U2 - 10.1007/978-3-642-30870-3_15
DO - 10.1007/978-3-642-30870-3_15
M3 - Book chapter
SN - 9783642308697
VL - 7318 LNCS
T3 - Lecture Notes in Computer Science
SP - 139
EP - 150
BT - How the World Computes
A2 - Cooper, S. Barry
A2 - Dawar, Anuj
A2 - Lowe, Benedikt
PB - Springer
CY - Heidelberg, Germany
T2 - Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012
Y2 - 17 June 2012 through 22 June 2012
ER -