![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Ambler S. Kwiatkowska M. Measor N.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.151, Iss.1, 1995-11, pp. : 3-27
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
By Hartonas C.
Theoretical Computer Science, Vol. 202, Iss. 1, 1998-07 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
The modal mu-calculus alternation hierarchy is strict
Theoretical Computer Science, Vol. 195, Iss. 2, 1998-03 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Coalgebraic modal logic: soundness, completeness and decidability of local consequence
By Pattinson D.
Theoretical Computer Science, Vol. 309, Iss. 1, 2003-12 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Model checking the full modal mu-calculus for infinite sequential processes
Theoretical Computer Science, Vol. 221, Iss. 1, 1999-06 ,pp. :