The propositional mu-calculus is elementary

This publication has 13 references indexed in Scilit:

• A decision procedure for the propositional μ-calculus
  Published by Springer Nature ,1984
• Propositional game logic
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1983
• Propositional dynamic logic of looping and converse is elementarily decidable
  Information and Control, 1982
• Results on the propositional μ-calculus
  Published by Springer Nature ,1982
• Characterizing correctness properties of parallel programs using fixpoints
  Published by Springer Nature ,1980
• Propositional dynamic logic of regular programs
  Journal of Computer and System Sciences, 1979
• Finiteness is mu-ineffable
  Theoretical Computer Science, 1976
• On the termination of program schemas
  Information and Control, 1975
• Weak monadic second order theory of succesor is not elementary-recursive
  Lecture Notes in Mathematics, 1975
• The emptiness problem for automata on infinite trees
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1972