Proceedings of the workshop on Advances in linear logic
Concurrent Games and Full Completeness
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Call-by-value is dual to call-by-name
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Sequentiality vs. concurrency in games and logic
Mathematical Structures in Computer Science
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Focusing and higher-order abstract syntax
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Logical Characterization of Forward and Backward Chaining in the Inverse Method
Journal of Automated Reasoning
A Neutral Approach to Proof and Refutation in MALL
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Focusing and polarization in linear, intuitionistic, and classical logics
Theoretical Computer Science
Least and greatest fixed points in linear logic
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Focusing the inverse method for linear logic
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
From proofs to focused proofs: a modular proof of focalization in linear logic
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
From Focalization of Logic to the Logic of Focalization
Electronic Notes in Theoretical Computer Science (ENTCS)
Classical and intuitionistic subexponential logics are equally expressive
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Magically constraining the inverse method using dynamic polarity assignment
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Compact proof certificates for linear logic
CPP'12 Proceedings of the Second international conference on Certified Programs and Proofs
| Hi-index | 0.00 |
It is well-known that focusing striates a sequent derivation into phases of like polarity where each phase can be seen as inferring a synthetic connective. We present a sequent calculus of synthetic connectives based on neutral proof patterns, which are a syntactic normal form for such connectives. Different focusing strategies arise from different polarisations and arrangements of synthetic inference rules, which are shown to be complete by synthetic rule permutations. A simple generic cut-elimination procedure for synthetic connectives respects both the ordinary focusing and the maximally multi-focusing strategies, answering the open question of cut-admissibility for maximally multi-focused proofs.