Abstract
I met Dexter Kozen in October 1979 at the FOCS meeting in Puerto Rico where he gave a paper on the semantics of probabilistic programs. The main reason for our discussion at that meeting was the fact that he was the referee of a paper which I had submitted to Theoretical Computer Science - TCS with Albert Meyer as editor.
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
References
Chandra, A., Kozen, D., Stockmeyer, L.: Alternation. Journal of the ACM (JACM)Â 28(1) (January 1981)
Fischer, M., Ladner, R.: Propositional dynamic logic of regular programs. Journal of Computer and System Sciences 18, 194–211 (1979)
Hopkins, M., Kozen, D.: Parikh’s Theorem in Commutative Kleene Algebra. In: Proc. 14th Conf. Logic in Computer Science (LICS 1999), pp. 394–401. IEEE (July 1999)
Kozen, D., Parikh, R.: An Elementary Completeness Proof for PDL. Theor. Comp. Sci. 14, 113–118 (1981)
Harel, D., Kozen, D., Parikh, R.: Process Logic: Expressiveness, Decidability, Completeness. JCSS 25, 144–170 (1982)
Kozen, D., Parikh, R.: A Decision Procedure for the Propositional μ-calculus. In: Clarke, E., Kozen, D. (eds.) Logic of Programs 1983. LNCS, vol. 164, pp. 313–325. Springer, Heidelberg (1984)
Pacuit, E., Parikh, R.: Social Interaction, Knowledge, and Social Software. In: Goldin, D., Smolka, S., Wegner, P. (eds.) Interactive Computation: The New Paradigm, pp. 441–462. Springer, Heidelberg (2007)
Parikh, R.: Language generating devices, MIT Research Laboratory for Electronics, Quarterly Progress Report, pp. 199–212 (January 1961) (republished as On Context Free Languages. Jour. ACM 13, 570-581 (1966))
Parikh, R.: The Completeness of Propositional Dynamic Logic. In: Winkowski, J. (ed.) MFCS 1978. LNCS, vol. 64, pp. 403–415. Springer, Heidelberg (1978)
Parikh, R.: Propositional Logics of Programs: A Survey. In: Engeler, E. (ed.) Logic of Programs 1979. LNCS, vol. 125, pp. 102–144. Springer, Heidelberg (1981) (one section of thie paper was written by Dexter, but he refused to be co-author, contenting himself with an acknowledgement within the paper)
Parikh, R.: The Logic of Games and its Applications. Annals of Discrete Math. 24, 111–140 (1985)
Parikh, R.: Social Software. Synthese 132, 187–211 (2002)
Pratt, V.: Semantical considerations on Floyd-Hoare Logic. In: Proceedings of the 17th Symposium on Foundations of Computer Science, pp. 109–121 (1976)
Pratt, V.: A practcal decision method for propositional dynamic logic. In: Proceedings of 10th ACM Symposium on Theory of Computation, pp. 326–337 (1978)
Segerberg, K.: A completeness proof for the modal logic of programs (preliminary report). Notices of the American Mathematical Society 24, A-552 (1977)
Wikipedia entry on Social Software, http://en.wikipedia.org/wiki/Social_software_social_procedure
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Parikh, R. (2012). An Appreciation of Dexter Kozen. 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_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-29485-3_29
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)