Abstract
I have known Dexter for 30 years, which, of course, means that I was 9 when I first met him. At that time, Dexter was already “the man”. Although he was only a few years ahead of me, he had already made his name by independently defining the notion of alternating Turing machines, a deep contribution to complexity theory that made it possible to connect time and space complexity. The results were viewed as so significant that it was already being taught in a graduate course on complexity theory that I attended. Of even more interest to me at the time was Dexter’s work on modal logic, since a large part of my thesis was on dynamic logic. Finding a sound and complete axiomatization for dynamic logic had been an open problem for many years. Krister Segerberg had suggested an obviously sound axiomatization, but couldn’t prove it complete. Rohit Parikh [7] showed that it was indeed complete, but his proof was rather complicated. Dexter then came up with a much simpler proof, one that got at the essence of Rohit’s ideas; this version was published as [6]. The proof is truly beautiful. I have taught it often, and used the ideas in a number of subsequent papers (e.g., [3,4]).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Ben-Or, M., Kozen, D., Reif, J.H.: The complexity of elementary algebra and geometry. Journal of Computer and System Sciences 32(1), 251–264 (1986)
Chandra, A.K., Kozen, D., Stockmeyer, L.J.: Alternation. Journal of the ACM 28, 114–133 (1981)
Emerson, E.A., Halpern, J.Y.: Decision procedures and expressiveness in the temporal logic of branching time. Journal of Computer and System Sciences 30(1), 1–24 (1985)
Halpern, J.Y., Moses, Y.: A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence 54, 319–379 (1992)
Kozen, D.: Results on the propositional μ-calculus. Theoretical Computer Science 27(1), 333–354 (1983)
Kozen, D., Parikh, R.: An elementary proof of the completeness of PDL. Theoretical Computer Science 14(1), 113–118 (1981)
Parikh, R.: The Completeness of Propositional Dynamic Logic. In: Winkowski, J. (ed.) MFCS 1978. LNCS, vol. 64, pp. 403–415. Springer, Heidelberg (1978)
Pratt, V.: A decidable μ-calculus. In: Proc. 22nd IEEE Symposium on Foundations of Computer Science, pp. 375–383 (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Halpern, J.Y. (2012). Dexter Kozen: An Appreciation. In: Constable, R.L., Silva, A. (eds) Logic and Program Semantics. Lecture Notes in Computer Science, vol 7230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29485-3_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-29485-3_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29484-6
Online ISBN: 978-3-642-29485-3
eBook Packages: Computer ScienceComputer Science (R0)