Dexter C. Kozen (kozen)

Beiträge zu Philosophie.ch

Bibliography

Chandra, Ashok K., Kozen, Dexter C. and Stockmeyer, L. J. 1981. “Alternation.” Journal of the Association for Computing Machinery 28: 114–133.
Harel, David and Kozen, Dexter C. 1982. “Process Logic: Expressiveness, Decidability, Completeness.” Journal of Computer and System Sciences 25: 144–170.
Harel, David, Kozen, Dexter C. and Tiuryn, J. 2001. “Dynamic Logic.” in Handbook of Philosophical Logic, Volume IV, edited by Dov M. Gabbay and Franz Guenthner, 2nd ed., pp. 99–218. Dordrecht: Springer. First publication as Harel (1984).
Kozen, Dexter C. 1983. “Results on the Propositional \(m\)-calculus.” Theoretical Computer Science 27: 333–354.
Kozen, Dexter C. 1994. “On Action Algebras.” in Logic and Information Flow, edited by Jan van Eijck and Albert Visser, pp. 78–88. Cambridge, Massachusetts: The MIT Press.
Kozen, Dexter C. 1997. Automata and Computability. Berlin: Springer.
Kozen, Dexter C. and Parikh, Rohit. 1981. “An Elementary Proof of the Completeness of PDL.” Theoretical Computer Science 14: 113–118.
Kozen, Dexter C. and Ramanarayanan, Ganesh. 2011. “Publication/Citation: A Proof-Theoretic Approach to Mathematical Knowledge Management.” in Games, Norms and Reasons. Logic at the Crossroads, edited by Johan van Benthem, Amitabha Gupta, and Eric Pacuit, pp. 151–162. Synthese Library n. 353. Dordrecht: Springer.
Kozen, Dexter C. and Tiuryn, J. 1990. “Logic of Programs.” in Handbook of Theoretical Computer Science: Formal Models and Semantics, edited by Jan van Leeuven, pp. 789–840. Cambridge, Massachusetts: The MIT Press.

Further References

Harel, David. 1984. “Dynamic Logic.” in Handbook of Philosophical Logic, Volume II: Extensions of Classical Logic, edited by Dov M. Gabbay and Franz Guenthner, pp. 497–604. Synthese Library n. 165. Dordrecht: D. Reidel Publishing Co. Reprinted in revised form as Harel, Kozen and Tiuryn (2001).