Cut elimination and complexity bounds for intuitionistic epistemic logic

被引:1
|
作者
Krupski, Vladimir N. [1 ]
机构
[1] Lomonosov Moscow State Univ, Fac Mech & Math, Moscow 119991, Russia
关键词
Modal logic; intuitionistic epistemic logic; sequent calculus; cut-elimination; PSPACE;
D O I
10.1093/logcom/exaa012
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The formal system of intuitionistic epistemic logic (IEL) was proposed by S. Artemov and T. Protopopescu. It provides the formal foundation for the study of knowledge from an intuitionistic point of view based on Brouwer-Heyting-Kolmogorov semantics of intuitionism. We construct a cut-free sequent calculus for IEL and establish that polynomial space is sufficient for the proof search in it. We prove that IEL is PSPACE-complete.
引用
收藏
页码:281 / 294
页数:14
相关论文
共 50 条