Polytime embedding of intuitionistic modal logics into their one-variable fragments

被引:0
|
作者
Rybakov, Mikhail [1 ]
Shkatov, Dmitry [2 ]
机构
[1] MIPT & HSE Univ, Higher Sch Modern Math, Moscow 115184, Russia
[2] Univ Witwatersrand, Sch Comp Sci & Appl Math, ZA-2050 Johannesburg, Wits, South Africa
关键词
intuitionistic modal logic; polynomial-time embedding; computational complexity; satisfiability problem; validity problem; COMPLEXITY;
D O I
10.1093/logcom/exae077
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We prove that propositional intuitionistic modal logics $\textbf{FS}$ (also known as $\textbf{IK}$) and $\textbf{MIPC}$ (also known as $\textbf{IS5}$) are polynomial-time embeddable into, and hence polynomial-time equivalent to, their own one-variable fragments. It follows that the one-variable fragment of $\textbf{MIPC}$ is coNEXPTIME-complete. The method of proof applies to a wide range of intuitionistic modal logics characterizable by two-dimensional frames, among them intuitionistic analogues of such classical modal logics as $\textbf{K4}$ and $\textbf{S4}$.
引用
收藏
页数:18
相关论文
共 50 条