A Local System for Classical Logic

Authors:
Kai Brünnler;Alwen Fernanto Tiu
Affiliations:
-;-
Venue:
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Year:
2001

Citing 3
Cited 12

Linear logic

Theoretical Computer Science
Basic proof theory

Basic proof theory
On Matrices with Connections

Journal of the ACM (JACM)

A Local System for Linear Logic

LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A Non-commutative Extension of MELL

LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic

TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Modular Sequent Systems for Modal Logic

TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
What is the problem with proof nets for classical logic?

CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
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)
A local system for intuitionistic logic

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Reducing nondeterminism in the calculus of structures

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Deep inference and its normal form of derivations

CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Naming proofs in classical propositional logic

TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Atomic Lambda Calculus: A Typed Lambda-Calculus with Explicit Sharing

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The calculus of structures is a framework for specifying logical systems, which is similar to the one-sided sequent calculus but more general. We present a system of inference rules for propositional classical logic in this new framework and prove cut elimination for it. The system enjoys a decomposition theorem for derivations that is not available in the sequent calculus. The main novelty of our system is that all the rules are local: contraction, in particular, is reduced to atomic form. This should be interesting for distributed proof-search and also for complexity theory, since the computational cost of applying each rule is bounded.