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 条
  • [31] The One-Variable Fragment of Corsi Logic
    Caicedo, Xavier
    Metcalfe, George
    Rodriguez, Ricardo
    Tuyt, Olim
    LOGIC, LANGUAGE, INFORMATION, AND COMPUTATION (WOLLIC 2019), 2019, 11541 : 70 - 83
  • [32] Complexity of finite-variable fragments of products with non-transitive modal logics
    Rybakov, Mikhail
    Shkatov, Dmitry
    JOURNAL OF LOGIC AND COMPUTATION, 2022, 32 (05) : 853 - 870
  • [33] REDUCTION OF MODALITIES IN SEVERAL INTUITIONISTIC MODAL-LOGICS
    MIHAJLOVA, M
    DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE, 1980, 33 (06): : 743 - 745
  • [34] Cut Elimination in Nested Sequents for Intuitionistic Modal Logics
    Strassburger, Lutz
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES (FOSSACS 2013), 2013, 7794 : 209 - 224
  • [35] Terminating sequent calculi for two intuitionistic modal logics
    Iemhoff, Rosalie
    JOURNAL OF LOGIC AND COMPUTATION, 2018, 28 (07) : 1701 - 1712
  • [36] MONADIC INTUITIONISTIC AND MODAL LOGICS ADMITTING PROVABILITY INTERPRETATIONS
    Bezhanishvili, Guram
    Brantley, Kristina
    Ilin, Julia
    JOURNAL OF SYMBOLIC LOGIC, 2023, 88 (01) : 427 - 467
  • [37] The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions
    Mundhenk, Martin
    Weiss, Felix
    REACHABILITY PROBLEMS, 2010, 6227 : 146 - 160
  • [38] A fully labelled proof system for intuitionistic modal logics
    Marin, Sonia
    Morales, Marianela
    Strassburger, Lutz
    JOURNAL OF LOGIC AND COMPUTATION, 2021, 31 (03) : 998 - 1022
  • [39] Gentzen sequent calculi for some intuitionistic modal logics
    Lin, Zhe
    Ma, Minghui
    LOGIC JOURNAL OF THE IGPL, 2019, 27 (04) : 596 - 623
  • [40] One-Variable Word Equations in Linear Time
    Jez, Artur
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT II, 2013, 7966 : 324 - 335