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

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2001, Pages 347-356

  Janin, D ^a   Lenzi, G ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DIFFERENTIATION (CALCULUS); HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; MODAL ANALYSIS;

MODAL FIXPOINT CALCULUS; MODEL CHECKING ALGORITHMS; MONADIC SECOND ORDER LOGIC; MUCALCULUS HIERARCHY; POLYMODAL LOGIC;

FORMAL LOGIC;

EID: 0034864197     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. Reachability is harder for directed rather than undirected finite graphs
2. The mu-calculus alternation-depth hierarchy over the binary tree is strict
3. The modal mu-calculus alternation hierarchy is strict
4. The monadic second-order logic of graphs VI: On several representations of graphs by logical structures
5. Temporal and modal logic
6. Generalized first-order spectra and polynomial-time recognizable sets
7. A sheaf representation and duality for finitely presented Heyting algebras
8. Back and forth between guarded and modal logics
9. Computational tree logic CTL* and path quantifiers in the monadic theory of the binary tree
10. Automata for the modal mucalculus and related results
11. On the expressive completeness of the modal mu-calculus w.r.t. monadic second order logic
12. Deciding the winner in parity games is in UP ∩ co-UP
13. Small progress measures for solving parity games
14. Results on the propositional μ-calculus
15. A new logical characterization of Büchi automata
16. The monadic quantifier alternation hierarchy over finite graphs is infinite
17. On the expressive power of CTL*
18. Hierarchies of weak automata on weak monadic formulas
19. Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
20. On fixed point clones
21. Bisimulation-invariant Ptime and higher-dimensional mu-calculus
22. Decidability of second order theories and automata on infinite trees
23. Weakly definable relations and special automata
24. Modal logic over finite structures
25. On three hierarchies of weak SkS formulas
26. A characterization of Büchi tree automata
27. An automata theoretic decision procedure for the propositional mu-calculus
28. Monadic second order logic on tree-like structures