Eliminating Recursion in the µ-Calculus

@inproceedings{Otto1999EliminatingRI,
  title={Eliminating Recursion in the µ-Calculus},
  author={Martin Otto},
  booktitle={STACS},
  year={1999}
}
Consider the following problem: given a formula of the modal-calculus, decide whether this formula is equivalently expressible in basic modal logic. It is shown that this problem is decidable, in fact in deterministic exponential time. The decidability result can be obtained through a model theoretic reduction to the monadic second-order theory of the complete binary tree, which by Rabin's classical result is decidable, albeit of non-elementary complexity. An improved analysis based on tree… CONTINUE READING
Highly Cited
This paper has 40 citations. REVIEW CITATIONS