An axiomatization of full computation tree logic

Journal of Symbolic Logic

Volumn 66, Issue 3, 2001, Pages 1011-1057

  Reynolds, M ^a  

^a MURDOCH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035629551     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2695091     Document Type: Article

References (27)

1. O. BERNHOLTZ and O. GRUMBERG, Buy one, get one free!!!, Temporal logic, Proceedings of ICTL'94 (D. Gabbay and H. Ohlbach, editors), LNAI, no. 827, Springer-Verlag, 1994, pp. 210-224.
2. J. P. BURGESS, Decidability for branching time, Stadia Logica, vol. 39 (1980), pp. 203-218.
3. E. CLARKE and E. EMERSON, Synthesis of synchronization skeletons for branching time temporal logic, Proc. IBM Workshop on Logic of Programs, Yorktown Heights, NY (Berlin), Springer, 1981, pp. 52-71.
4. M. DAM, R-generability, and definability in branching time logics, Information Processing Letters, vol. 41 (1992), pp. 281-287.
5. E. EMERSON, Alternative semantics for temporal logics, Theoretical Computer Science, vol. 26 (1983).
6. _, Automated temporal reasoning for reactive systems, Logics for concurrency (F. Moller and G. Birtwistle, editors), Springer Verlag, 1996, pp. 41-101.
7. E. EMERSON and J. HALPERN, Decision procedures and expressiveness in the temporal logic of branching time, Proc. 14th ACM Symp. on Theory of Computing, 1982.
8. _, 'Sometimes' and 'not never' revisited: on branching versus linear time, Journal of the ACM, vol. 33 (1986).
9. E. EMERSON and C. JUTLA, Complexity of tree automata and modal logics of programs, 29th IEEE Foundations of Computer Science, Proceedings, IEEE, 1988.
10. E. EMERSON and A. SISTLA, Deciding full branching time logic, Information and Control, vol. 61 (1984), pp. 175-201.
11. E. A. EMERSON, Temporal and modal logic, Handbook of theoretical computer science (J. van Leeuwen, editor), vol. B, Elsevier, Amsterdam, 1990.
12. D. GABBAY, I. HODKINSON, and M. REYNOLDS, Temporal logic: Mathematical foundations and computational aspects, vol. 1, Oxford University Press, 1994.
13. D. M. GABBAY, An irreflexivity lemma with applications to axiomatizations of conditions on tense frames, Aspects of philosophical logic (U. Monnich, editor), Reidel, Dordrecht, 1981, pp. 67-89.
14. D. M. GABBAY, A. PNUELI, S. SHELAH, and J. STAVI, On the temporal analysis of fairness, 7th ACM Symposium on Principles of Programming Languages, Las Vegas, 1980, pp. 163-173.
15. R. KAIVOLA, Axiomatising extended computation tree logic, in trees in algebra a programming, CAAP'96, 21st International Colloquium, Proceedings, vol. 1059, Springer, 1996, pp. 87-101.
16. YONIT KESTEN and AMIR PNUELI, A complete proof systems for QPTL. Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science (San Diego, California), IEEE Computer Society Press, 26-29 June 1995, pp. 2-12.
17. R. MCNAUGHTON, Testing and generating infinite sequences by finite automata, Information and Control, vol. 9 (1966), pp. 521-530.
18. A. PNUELI, The temporal logic of programs, Proceedings of the Eighteenth Symposium on Foundations of Computer Science (Providence, RI), 1977, pp. 46-57.
19. S. SAFRA, On the complexity of ω-automata, Proceedings of 29th IEEE Symposium on the Foundations of Computer Science, 1988.
20. C. STIRLING, Modal and temporal logics, Handbook of Logic in Computer Science, Volume 2 (S. Abramsky, D. Gabbay, and T. Maibaum, editors), OUP, 1992, pp. 477-563.
21. R. THOMASON, Combinations of tense and modality, Handbook of philosophical logic, Vol II: Extensions of classical logic (D. Gabbay and F. Guenthner, editors), Reidel, Dordrecht, 1984, pp. 135-165.
22. M. VARDI and L. STOCKMEYER, Improved upper and lower bounds for modal logics of programs, 17th ACM Symp. on Theory of Computing, Proceedings, ACM, 1985, pp. 240-251.
23. I. WALUKIEWICZ, A complete deductive system for the μ-calculus, BRICS Research Report RS-95-6, Department of Computer Science, University of Aarhus, Denmark, 1995.
24. A. ZANARDO, A finite axiomatization of the set of strongly valid Ockamist formulas, Journal of Philosophical Logic, vol. 14 (1985), pp. 447-468.
25. _, Branching-time logic with quantification over branches: the point of view of modal logic, this JOURNAL, vol. 61 (1996), pp. 1-39.
26. A. ZANARDO, B. BARCELLAN, and M. REYNOLDS, Nondefinability of the class of complete bundled trees, Logic Journal of the IGPL, vol. 7 (1999), no. 1, pp. 125-136.
27. ALBERTO ZANARDO and JOSÉ CARMO, Ockhamist computational logic: Past-sensitive necessitation in CTL, Journal of Logic and Computation, vol. 3 (1993), no. 3, pp. 249-268.