| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9657913 | Theoretical Computer Science | 2005 | 32 Pages |
Abstract
Finally, we lift the results obtained for the μ-calculus of tree languages to the propositional modal μ-calculus: ambiguous classes do not coincide with composition classes, but a separation theorem is established for disjunctive formulas.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Luigi Santocanale, André Arnold,