Relating levels of the mu-calculus hierarchy and levels of the monadic hierachy

被引:0
|
作者
Janin, D [1 ]
Lenzi, G [1 ]
机构
[1] Univ Bordeaux 1, ENSERB, F-33405 Talence, France
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
As already known [14], the mu-calculus [17] is as expressive as the bisimulation invariant fragment of monadic second order Logic (MSO). In this paper, ive relate the expressiveness of levels of the fixpoint alternation depth hierarchy of the mu-calculus (the mu-calculus hierarchy) with the expressiveness of the bisimulation invariant fragment of levels of the monadic quantifiers alternation-depth hierarchy (the monadic hierarchy). From van Benthem's result [3], we know already that the fixpoint free fragment of the mu-calculus (i.e. polymodal Logic) is as expressive as the bisimulation invariant fragment of monadic Sigma (0) (i.e. first order logic). We show here that the v-level (resp. the nu mu -level) of the mu-calculus hierarchy is as expressive cis the bisimulation invariant fragment of monadic Sigma (1) (resp. monadic Sigma (2)) and we show that no other level Sigma (k) for k > 2 of the monadic hierarchy can be related similarly with any other level of the mu-calculus hierarchy. The possible inclusion of all the mu-calculus in some level Sigma (k) of the monadic hierarchy, for some k > 2, is also discussed.
引用
收藏
页码:347 / 356
页数:10
相关论文
共 50 条
  • [1] The Arity Hierarchy in the Polyadic mu-Calculus
    Lange, Martin
    [J]. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2015, (191): : 105 - 116
  • [2] Simplifying the modal mu-calculus alternation hierarchy
    Bradfield, JC
    [J]. STACS 98 - 15TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1998, 1373 : 39 - 49
  • [3] The modal mu-calculus alternation hierarchy is strict
    Bradfield, JC
    [J]. THEORETICAL COMPUTER SCIENCE, 1998, 195 (02) : 133 - 153
  • [4] On the relationship between monadic and weak monadic second order logic on arbitrary trees, with applications to the mu-calculus
    Janin, D
    Lenzi, G
    [J]. FUNDAMENTA INFORMATICAE, 2004, 61 (3-4) : 247 - 265
  • [5] Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus
    Dima, Catalin
    Maubert, Bastien
    Pinchinat, Sophie
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2015, PT I, 2015, 9234 : 179 - 191
  • [6] Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus
    Dima, Catalin
    Maubert, Bastien
    Pinchinat, Sophie
    [J]. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2018, 19 (03)
  • [7] Games for the mu-calculus
    Niwinski, D
    Walukiewicz, I
    [J]. THEORETICAL COMPUTER SCIENCE, 1996, 163 (1-2) : 99 - 116
  • [8] EQUATIONAL MU-CALCULUS
    NIWINSKI, D
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1985, 208 : 167 - 176
  • [9] Domain mu-calculus
    Zhang, GQ
    [J]. RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2003, 37 (04): : 337 - 364
  • [10] Lukasiewicz mu-calculus
    Mio, Matteo
    Simpson, Alex
    [J]. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2013, (126): : 87 - 104