Classical and Intuitionistic Subexponential Logics Are Equally Expressive

被引:0
|
作者
Chaudhuri, Kaustuv
机构
来源
COMPUTER SCIENCE LOGIC | 2010年 / 6247卷
关键词
SEQUENT CALCULUS;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:185 / 199
页数:15
相关论文
共 50 条