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 条
  • [31] APERIODICITY, STAR-FREENESS, AND FIRST-ORDER LOGIC DEFINABILITY OF OPERATOR PRECEDENCE LANGUAGES
    Mandrioli, Dino
    Pradella, Matteo
    Reghizzi, Stefano crespi
    [J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2023, 19 (04) : 1 - 12
  • [32] Compactness in first-order logic and its relation to the completeness theorem
    Aliseda, A
    [J]. CRITICA-REVISTA HISPANOAMERICANA DE FILOSOFIA, 1999, 31 (93): : 117 - 124
  • [33] αleanTAP: A Declarative Theorem Prover for First-Order Classical Logic
    Near, Joseph P.
    Byrd, William E.
    Friedman, Daniel P.
    [J]. LOGIC PROGRAMMING, PROCEEDINGS, 2008, 5366 : 238 - 252
  • [34] APPROACH TO A SYSTEMATIC THEOREM PROVING PROCEDURE IN FIRST-ORDER LOGIC
    BIBEL, W
    [J]. COMPUTING, 1974, 12 (01) : 43 - 55
  • [35] Definability in first-order theories of graph orderings
    Ramanujam, R.
    Thinniyam, Ramanathan S.
    [J]. JOURNAL OF LOGIC AND COMPUTATION, 2020, 30 (01) : 403 - 420
  • [36] The complexity of definability by open first-order formulas
    Areces, Carlos
    Campercholi, Miguel
    Penazzi, Daniel
    Ventura, Pablo
    [J]. LOGIC JOURNAL OF THE IGPL, 2020, 28 (06) : 1093 - 1105
  • [37] Term definable classes of boolean functions and frame definability in modal logic
    Couceiro, Miguel
    Hella, Lauri
    Kivela, Jari
    [J]. LOGIC JOURNAL OF THE IGPL, 2008, 16 (01) : 43 - 73
  • [38] Representing Buridan's Divided Modal Propositions in First-Order Logic
    Dagys, Jonas
    Pabijutaite, Zivile
    Giedra, Haroldas
    [J]. HISTORY AND PHILOSOPHY OF LOGIC, 2022, 43 (03) : 264 - 274
  • [39] On the Proof-Theory of two Formalisations of Modal First-Order Logic
    Schwartz, Yehuda
    Tourlakis, George
    [J]. STUDIA LOGICA, 2010, 96 (03) : 349 - 373
  • [40] On the Proof-Theory of two Formalisations of Modal First-Order Logic
    Yehuda Schwartz
    George Tourlakis
    [J]. Studia Logica, 2010, 96 : 349 - 373