Eliminating recursion in the μ-calculus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1563, Issue , 1999, Pages 531-540

  Otto, Martin ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; COMPUTABILITY AND DECIDABILITY; TEMPORAL LOGIC; TREES (MATHEMATICS);

COMPLETE BINARY TREE; DECISION PROCEDURE; EXPONENTIAL TIME; FOLLOWING PROBLEM; MODAL MU CALCULUS; MODEL-THEORETIC; MONADIC SECOND ORDER THEORY; TREE AUTOMATA;

CALCULATIONS;

EID: 84957069698     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49116-3_50     Document Type: Conference Paper

References (17)

1. J. Barwise and Y.N. Moschovakis, Global inductive definability, Journal of Symbolic Logic, 43(3), 1978, pp. 521-534.
2. J.F.A.K. van Benthem, Modal Logic and Classical Logic, Bibliopolis, 1985.
3. S.S. Cosmadakis, H. Gaifman, P.C. Kanellakis, and M.Y. Vardi, Decidable optimization problems for database logic programs, Proc. 20th ACM Symp. on Theory of Computing, 1988, pp. 477-490.
4. E.A. Emerson and C. Jutla, The complexity of tree automata and logics of programs, Proc. 29thSymp. on Foundations of Computer Science, 1988, pp. 328-337.
5. E.A. Emerson and R. Streett, An automata theoretic decision procedure for the propositional mu-calculus, Information and Computation, 81, 1989, pp. 249-264.
6. M.J. Fischer and R.E. Ladner, Propositional dynamic logic of regular programs, Journal of Computer and System Sciences, 18, 1979, pp. 194-211.
7. H. Gaifman, H. Mairson, Y. Sagiv, and M.Y. Vardi, Undecidable optimization problems for database logic problems, Journal of the Association for Computing Machinery, 40, 1993, pp. 683-713.
8. E. Grädel and M. Otto, On logics with two variables, to appear in Theoretical Computer Science.
9. G.G. Hillebrand, P.C. Kanellakis, H.G. Mairson, and M.Y. Vardi, Undecidable boundedness problems for Datalog programs, Journal of Logic Programming, 25, 1995, pp. 163-190.
10. D. Janin and I. Walukiewicz, On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic, Proc. of 7th Int. Conf. on Concurrency Theory, 1996, pp. 263-277.
11. P.G. Kolaitis and M. Otto, On the boundedness problem for two-variable first- order logic, Proc. 13th Symp. on Logic in Computer Science, LICS'98, pp. 513-524.
12. D. Kozen, Results on the propositional μ-calculus, Theoretical computer Science, 27, 1983, pp. 333-354.
13. D. Kozen, A finite model theorem for the propositional μ-calculus, Studia Logica, 47, 1987, pp. 233-241.
14. M.O. Rabin, Decidability of second-order theories and automata on infinite trees, Transactions of the American Mathematical Society, 141, 1969, pp. 1-35.
15. W. Thomas, Languages, Automata, and Logic, in Handbook of Formal Languages, vol. 3, G. Rozenberg and A. Salomaa, ed., Springer, 1997, pp. 389-456.
16. M.Y. Vardi, Automata theory for database theoreticians, in Theoretical Studies in Computer Science, J.D. Ullman, ed., Academic Press, 1992, pp. 153-180.
17. M.Y. Vardi, Why is modal logic so robustly decidable, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 31, AMS, 1997, 149-184.