The μ-Calculus Alternation Depth Hierarchy is infinite over finite planar graphs
Authors:
- Giovanna D'AgostinoGDGiovanna D'Agostino
- Giacomo LenziGLGiacomo Lenzi
- 1 August 2018
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 737, 40-61
Abstract
No abstract availableKeywords
Funding Information
- PRID ENCASE fundings (20170000045/III.13.4)
This publication has 11 references indexed in Scilit:
- Entanglement and the complexity of directed graphsTheoretical Computer Science, 2012
- On modal -calculus over reflexive symmetric graphsJournal of Logic and Computation, 2012
- On the -calculus over transitive and finite transitive framesTheoretical Computer Science, 2010
- The modalμ-calculus hierarchy over restricted classes of transition systemsThe Journal of Symbolic Logic, 2009
- Modal characterisation theorems over special classes of framesAnnals of Pure and Applied Logic, 2009
- Alternating tree automata, parity games, and modal {$\mu$}-calculusBulletin of the Belgian Mathematical Society - Simon Stevin, 2001
- Theμ-calculus alternation-depth hierarchy is strict on binary treesRAIRO - Theoretical Informatics and Applications, 1999
- The modal mu-calculus alternation hierarchy is strictTheoretical Computer Science, 1998
- Results on the propositional μ-calculusTheoretical Computer Science, 1983
- Propositional dynamic logic of regular programsJournal of Computer and System Sciences, 1979