Classical and Intuitionistic Subexponential Logics are Equally Expressive - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Classical and Intuitionistic Subexponential Logics are Equally Expressive

Résumé

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.
Fichier principal
Vignette du fichier
clasint.pdf (132.55 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00534865 , version 1 (10-11-2010)

Identifiants

Citer

Kaustuv Chaudhuri. Classical and Intuitionistic Subexponential Logics are Equally Expressive. Computer Science Logic, Aug 2010, Brno, Czech Republic. pp.185--199, ⟨10.1007/978-3-642-15205-4_17⟩. ⟨inria-00534865⟩
126 Consultations
114 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More