Classical and Intuitionistic Subexponential Logics Are Equally Expressive

It is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented in the intuitionistic logic by double-negation, while the other direction has no truth-preserving propositional encodings. We show here that subexponential logic, which is a family of substructural refinements of classical logic, each parametric over a preorder over the subexponential connectives, does not suffer from this asymmetry if the preorder is systematically modified as part of the encoding. Precisely, we show a bijection between synthetic (i.e., focused) partial sequent derivations modulo a given encoding. Particular instances of our encoding for particular subexponential preorders give rise to both known and novel adequacy theorems for substructural logics.

[1]  Harold Schellinx,et al.  Some Syntactical Observations on Linear Logic , 1991, J. Log. Comput..

[2]  Chuck Liang,et al.  Focusing and polarization in linear, intuitionistic, and classical logics , 2009, Theor. Comput. Sci..

[3]  Vincent Danos,et al.  The Structure of Exponentials: Uncovering the Dynamics of Linear Logic Proofs , 1993, Kurt Gödel Colloquium.

[4]  Bor-Yuh Evan Chang,et al.  A judgmental analysis of linear logic , 2003 .

[5]  Andrew Barber,et al.  Dual Intuitionistic Linear Logic , 1996 .

[6]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[7]  Vivek Nigam,et al.  Exploiting non-canonicity in the sequent calculus , 2009 .

[8]  Frank Pfenning,et al.  The focused inverse method for linear logic , 2006 .

[9]  Frank Pfenning,et al.  A Logical Characterization of Forward and Backward Chaining in the Inverse Method , 2007, Journal of Automated Reasoning.

[10]  M. Nivat Fiftieth volume of theoretical computer science , 1988 .

[11]  Dale Miller Finding unity in computational logic , 2010 .

[12]  JEAN-MARC ANDREOLI,et al.  Logic Programming with Focusing Proofs in Linear Logic , 1992, J. Log. Comput..

[13]  Dale Miller,et al.  Algorithmic specifications in linear logic with subexponentials , 2009, PPDP '09.

[14]  Dale Miller,et al.  A Unified Sequent Calculus for Focused Proofs , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[15]  Olivier Laurent,et al.  Étude de la polarisation en logique , 2001 .

[16]  Kaustuv Chaudhuri Focusing Strategies in the Sequent Calculus of Synthetic Connectives , 2008, LPAR.