Skip to main content
Conference Proceedings

Results on the propositional μ-calculus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1982) 140 LNCS 348-359
DOI: 10.1007/BFb0012782
115Citations
Citations of this article
64Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We define a propositional version of the μ-calculus, and give an exponential-time decision procedure, small model property, and complete deductive system. We also show that it is strictly more expressive than PDL. Finally, we give an algebraic semantics and prove a representation theorem.

Cite

CITATION STYLE

APA

Kozen, D. (1982). Results on the propositional μ-calculus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 140 LNCS, pp. 348–359). Springer Verlag. https://doi.org/10.1007/BFb0012782

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free