Results on the propositional μ-calculus
- 1 January 1983
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 27 (3), 333-354
- https://doi.org/10.1016/0304-3975(82)90125-6
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- An elementary proof of the completeness of PDLTheoretical Computer Science, 1981
- The prepositional dynamic logic of deterministic, well-structured programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- A decidable mu-calculus: Preliminary reportPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- AlternationJournal of the ACM, 1981
- A near-optimal method for reasoning about actionJournal of Computer and System Sciences, 1980
- Propositional dynamic logic of regular programsJournal of Computer and System Sciences, 1979