A note on the completeness of Kozen's axiomatisation of the propositional μ-calculus

Bulletin of Symbolic Logic

Volumn 2, Issue 3, 1996, Pages 349-366

  Walukiewicz, Igor ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030237967     PISSN: 10798986     EISSN: None     Source Type: Journal    
DOI: 10.2307/420995     Document Type: Review

References (18)

1. R. BULL and K. SEGERBERG, Basic modal logic, Handbook of philosophical logic (D. Gabbay and F. Guenther, editors), vol. 2, D. Reidel Publishing Company, 1984, pp. 1-89.
2. E. A. EMERSON, Temporal and modal logic, Handbook of theoretical computer science (J. Leeuven, editor), vol. B, Elsevier, 1990, pp. 995-1072.
3. E. A. EMERSON and C. S. JUTLA, The complexity of tree automata and logics of programs, 29th FOCS, 1988.
4. M. FITTING, Proof methods for modal and intuitionistic logics, D. Reidel Publishing Company, 1983.
5. D. HAREL, Dynamic logic, Handbook of philosophical logic, vol. II, D. Reidel Publishing Company, 1984, pp. 497-604.
6. D. JANIN and I. WALUKIEWICZ, Automata for the μ-calculus and related results, MFCS '95, Lecture Notes in Computer Science, vol. 969, 1995, pp. 552-562.
7. R. KAIVOLA, Axiomatising linear time μ-calculus, CONCUR '95, Lecture Notes in Computer Science, vol. 962, 1995, pp. 423-437.
8. D. KOZEN, Results on the proportional μ-calculus, Theoretical Computer Science, vol. 27 (1983), pp. 333-354.
9. _, A finite model theorem for the propositional μ-calculus, Studia Logica, vol. 47 (1988), no. 3, pp. 234-241.
10. D. KOZEN and J. TIURYN, Logics of programs, Handbook of theoretical computer science (J. Leeuven, editor), vol. B, Elsevier, 1990, pp. 789-840.
11. A. W. MOSTOWSKI, Regular expressions for infinite trees and a standard form of automata, Fifth symposium on computation theory (A. Skowron, editor), Lecture Notes in Computer Science, vol. 208, 1984, pp. 157-168.
12. D. NIWIŃSKI, Fixed points vs. infinite generation, LICS '88, 1988, pp. 402-409.
13. D. NIWIŃSKI and I. WALUKIEWICZ, Games for μ-calculus, Technical Report TR 94-03 (192), Institute of Informatics, Warsaw Univeristy, February 1994, to appear in Theoretical Computer Science; available from: http://www.daimi.aau.dk/~igw/home.html.
14. M. RABIN., Decidability of second-order theories and automata on infinite trees, Transactions of the American Mathematical Society, vol. 141 (1969), pp. 1-35.
15. D. SIEFKES, Büchi's monadic second order successor arithmetic, Lecture notes in mathematics, vol. 120, Springer-Verlag, 1970.
16. C. S. STIRLING, Modal and temporal logics, Handbook of logic in comuter science (S. Abramsky, D. Gabbay, and T. Maibaum, editors), Oxford University Press, 1991, pp. 477-563.
17. R. S. STREETT and E. A. EMERSON, An automata theoretic procedure for the propositional μ-calculus, Information and Computation, vol. 81 (1989), pp. 249-264.
18. I. WALUKIEWICZ, On completeness of the μ-calculus, LICS '93, 1993, pp. 136-146.