The complexity of the modal predicate logic of "true in every transitive model of ZF"

被引:0
|
作者
McGee, V [1 ]
机构
[1] MIT, Dept Linguist & Philosophy, Cambridge, MA 02139 USA
关键词
D O I
10.2307/2275648
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
[No abstract available]
引用
收藏
页码:1371 / 1378
页数:8
相关论文
共 50 条
  • [21] Formula-Layered predicate modal logic
    Sun, Mei-Ying
    Deng, Shao-Bo
    Chen, Bo
    Cao, Cun-Gen
    Sui, Yue-Fei
    Ruan Jian Xue Bao/Journal of Software, 2014, 25 (05): : 1014 - 1024
  • [22] Undecidability of the transitive graded modal logic with converse
    Zolin, Evgeny
    JOURNAL OF LOGIC AND COMPUTATION, 2017, 27 (05) : 1398 - 1420
  • [23] Non-transitive counterparts of every Tarskian logic
    Szmuc, Damian E.
    ANALYSIS, 2024, 84 (02) : 320 - 326
  • [24] Two-Sided Trees for Sentential Logic, Predicate Logic, and Sentential Modal Logic
    Fitts, Jesse
    Beisecker, David
    TEACHING PHILOSOPHY, 2019, 42 (01) : 41 - 56
  • [25] The complexity of predicate default logic over a countable domain
    Milnikel, RS
    ANNALS OF PURE AND APPLIED LOGIC, 2003, 120 (1-3) : 151 - 163
  • [26] Unification in first-order transitive modal logic
    Dzik, Wojciech
    Wojtylak, Piotr
    LOGIC JOURNAL OF THE IGPL, 2019, 27 (05) : 693 - 717
  • [27] RETRACTED ARTICLE: A completeness theorem for continuous predicate modal logic
    Stefano Baratella
    Archive for Mathematical Logic, 2017, 56 : 1135 - 1135
  • [28] Recursive enumerability and elementary frame definability in predicate modal logic
    Rybakov, Mikhail
    Shkatov, Dmitry
    JOURNAL OF LOGIC AND COMPUTATION, 2020, 30 (02) : 549 - 560
  • [29] Completeness result for languages of tempo-modal predicate logic
    Strobach, N
    ERKENNTNIS, 2001, 55 (01) : 117 - 121
  • [30] ARITHMETICAL INTERPRETATIONS AND KRIPKE FRAMES OF PREDICATE MODAL LOGIC OF PROVABILITY
    Kurahashi, Taishi
    REVIEW OF SYMBOLIC LOGIC, 2013, 6 (01): : 129 - 146