Expressivity in chain-based modal logics

被引：11
|
作者：
Marti, Michel [1 ]
Metcalfe, George [2 ]
机构：
[1] Univ Bern, Inst Comp Sci, Neubruckstr 10, CH-3012 Bern, Switzerland
[2] Univ Bern, Math Inst, Sidlerstr 5, CH-3012 Bern, Switzerland
来源：
ARCHIVE FOR MATHEMATICAL LOGIC | 2018年 / 57卷 / 3-4期
基金：
瑞士国家科学基金会;
关键词：
Modal logic; Many-valued logic; Bisimulation; Modal equivalence; Hennessy-Milner property; DECIDABILITY; ALGEBRAS;
D O I：
10.1007/s00153-017-0573-4
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We investigate the expressivity of many-valued modal logics based on an algebraic structure with a complete linearly ordered lattice reduct. Necessary and sufficient algebraic conditions for admitting a suitable Hennessy-Milner property are established for classes of image-finite and (appropriately defined) modally saturated models. Full characterizations are obtained for many-valued modal logics based on complete BL-chains that are finite or have the real unit interval [0, 1] as a lattice reduct, including Aukasiewicz, Godel, and product modal logics.
引用
收藏
页码：361 / 380
页数：20
相关论文
共 50 条
  • [1] Expressivity in chain-based modal logics
    Michel Marti
    George Metcalfe
    [J]. Archive for Mathematical Logic, 2018, 57 : 361 - 380
  • [2] Exemplaric Expressivity of Modal Logics
    Jacobs, Bart
    Sokolova, Ana
    [J]. JOURNAL OF LOGIC AND COMPUTATION, 2010, 20 (05) : 1041 - 1068
  • [3] Modal Logics for Preferences and Cooperation: Expressivity and Complexity
    Degremont, Cedric
    Kurzen, Lena
    [J]. KNOWLEDGE REPRESENTATION FOR AGENTS AND MULTI-AGENT SYSTEMS, 2009, 5605 : 32 - 50
  • [4] Modal Logics with Composition on Finite Forests: Expressivity and Complexity
    Bednarczyk, Bartosz
    Demri, Stephane
    Fervari, Raul
    Mansutti, Alessio
    [J]. PROCEEDINGS OF THE 35TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2020), 2020, : 167 - 180
  • [5] Expressivity of Many-Valued Modal Logics, Coalgebraically
    Bilkova, Marta
    Dostal, Matej
    [J]. LOGIC, LANGUAGE, INFORMATION, AND COMPUTATION, 2016, 9803 : 109 - 124
  • [6] Expressivity of Quantitative Modal Logics Categorical Foundations via Codensity and Approximation
    Komorida, Yuichi
    Katsumata, Shin-ya
    Kupke, Clemens
    Rot, Jurriaan
    Hasuo, Ichiro
    [J]. 2021 36TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2021,
  • [7] The expressivity of update logics
    Kuijer, Louwe B.
    [J]. JOURNAL OF LOGIC AND COMPUTATION, 2015, 25 (03) : 719 - 742
  • [8] Markov chain-based analysis and fault tolerance technique for enhancing chain-based routing in WSNs
    Jalili, Ahmad
    Alzubi, Jafar A.
    Rezaei, Roghayeh
    Webber, Julian L.
    Fernandez-Campusano, Christian
    Gheisari, Mehdi
    Amin, Rashid
    Mehbodniya, Abolfazl
    [J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2024, 36 (12):
  • [9] 2 EXAMPLES OF CHAIN-BASED LATTICES
    SALONI, Z
    [J]. BULLETIN DE L ACADEMIE POLONAISE DES SCIENCES-SERIE DES SCIENCES MATHEMATIQUES ASTRONOMIQUES ET PHYSIQUES, 1976, 24 (02): : 89 - 90
  • [10] Development of a chain-based mobile robot
    Erchen, Sven
    Triller, Max
    Sohlbach, Lukas
    Schmidt, Karsten
    [J]. 2020 21ST INTERNATIONAL CONFERENCE ON RESEARCH AND EDUCATION IN MECHATRONICS (REM), 2020,
12345