First-Order Modal Logic: Frame Definability and a Lindström Theorem

被引:0
|
作者
R. Zoghifard
M. Pourmahdian
机构
[1] Amirkabir University of Technology,Department of Mathematics and Computer Science
[2] Institute for Research in Fundamental Sciences (IPM),School of Mathematics
来源
Studia Logica | 2018年 / 106卷
关键词
First-order modal logic; Kripke semantics; Bisimulation; Goldblatt–Thomason theorem; Lindström theorem;
D O I
暂无
中图分类号
学科分类号
摘要
We generalize two well-known model-theoretic characterization theorems from propositional modal logic to first-order modal logic (FML, for short). We first study FML-definable frames and give a version of the Goldblatt–Thomason theorem for this logic. The advantage of this result, compared with the original Goldblatt–Thomason theorem, is that it does not need the condition of ultrafilter reflection and uses only closure under bounded morphic images, generated subframes and disjoint unions. We then investigate Lindström type theorems for first-order modal logic. We show that FML has the maximal expressive power among the logics extending FML which satisfy compactness, bisimulation invariance and the Tarski union property.
引用
收藏
页码:699 / 720
页数:21
相关论文
共 50 条
  • [41] A defense of the Kripkean account of logical truth in first-order modal logic
    McKeon, M
    [J]. JOURNAL OF PHILOSOPHICAL LOGIC, 2005, 34 (03) : 305 - 326
  • [42] A Defense of the Kripkean Account of Logical Truth in First-Order Modal Logic
    M. McKeon
    [J]. Journal of Philosophical Logic, 2005, 34 : 305 - 326
  • [43] Completeness theorems for (sic)▭-bundled fragment of first-order modal logic
    Wang, Xun
    [J]. SYNTHESE, 2023, 201 (04)
  • [44] UNIVERSAL 1ST ORDER DEFINABILITY IN MODAL LOGIC
    JENNINGS, RE
    JOHNSTON, DK
    SCHOTCH, PK
    [J]. ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1980, 26 (04): : 327 - 330
  • [45] iProver - An instantiation-based theorem prover for first-order logic
    Korovin, Konstantin
    [J]. AUTOMATED REASONING, PROCEEDINGS, 2008, 5195 : 292 - 298
  • [46] Semantical Completeness of First-Order Predicate Logic and the Weak Fan Theorem
    Krivtsov, Victor N.
    [J]. STUDIA LOGICA, 2015, 103 (03) : 623 - 638
  • [47] First-order logic with metric betweenness - the case of non-definability of some graph classes
    Jacob, Jeny
    Changat, Manoj
    [J]. AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2023,
  • [48] A Deep Reinforcement Learning Approach to First-Order Logic Theorem Proving
    Crouse, Maxwell
    Abdelaziz, Ibrahim
    Makni, Bassem
    Whitehead, Spencer
    Cornelio, Cristina
    Kapanipathi, Pavan
    Srinivas, Kavitha
    Thost, Veronika
    Witbrock, Michael
    Fokoue, Achille
    [J]. THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 6279 - 6287
  • [49] Semantical Completeness of First-Order Predicate Logic and the Weak Fan Theorem
    Victor N. Krivtsov
    [J]. Studia Logica, 2015, 103 : 623 - 638
  • [50] Ultraproduct theorem of first-order lattice-valued logic FM
    Wang, XF
    Xu, Y
    [J]. 6TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL XVI, PROCEEDINGS: COMPUTER SCIENCE III, 2002, : 125 - 129