Deep inference and its normal form of derivations

Authors:
Kai Brünnler
Affiliations:
Institut für angewandte Mathematik und Informatik, Bern, Switzerland
Venue:
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Year:
2006

Citing 4
Cited 5

A Local System for Classical Logic

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Non-commutativity and MELL in the Calculus of Structures

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
A system of interaction and structure

ACM Transactions on Computational Logic (TOCL)
Naming proofs in classical propositional logic

TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications

On the proof complexity of deep inference

ACM Transactions on Computational Logic (TOCL)
A quasipolynomial cut-elimination procedure in deep inference via atomic flows and threshold formulae

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
A system of interaction and structure IV: The exponentials and decomposition

ACM Transactions on Computational Logic (TOCL)
On the proof complexity of cut-free bounded deep inference

TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Bunched Logics Displayed

Studia Logica

Quantified Score

Hi-index	0.00

Visualization

Abstract

We see a notion of normal derivation for the calculus of structures, which is based on a factorisation of derivations and which is more general than the traditional notion of cut-free proof in this formalism.