Author of the publication

The Propositional Mu-Calculus is Elementary.

, and . ICALP, volume 172 of Lecture Notes in Computer Science, page 465-472. Springer, (1984)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The Propositional Mu-Calculus is Elementary., and . ICALP, volume 172 of Lecture Notes in Computer Science, page 465-472. Springer, (1984)The Deducibility Problem in Propositional Dynamic Logic., , and . ICALP, volume 115 of Lecture Notes in Computer Science, page 238-248. Springer, (1981)The Deducibility Problem in Propositional Dynamic Logic., , and . Logic of Programs, volume 125 of Lecture Notes in Computer Science, page 12-22. Springer, (1979)Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable. Inf. Control., 54 (1/2): 121-141 (July 1982)Propositional Dynamic Logic of Looping and Converse. STOC, page 375-383. ACM, (1981)Fixpoints and Program Looping: Reductions form the Propositional MU-Calculus into Propositional Dynamic Logics of Looping.. Logic of Programs, volume 193 of Lecture Notes in Computer Science, page 359-372. Springer, (1985)An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus, and . Inf. Comput., 81 (3): 249-264 (June 1989)