Dexter Kozen

Dexter Kozen

Dexter Campbell Kozen is an American theoretical computer scientist. He is currently Joseph Newton Pew, Jr. Professor in Engineering at Cornell University. He received his B.A. from Dartmouth College in 1974 and his PhD in computer science from Cornell University in 1976, where he was advised by Juris Hartmanis.[1]

He is a Fellow of the Association of Computing Machinery, a Guggenheim Fellow, and has received a Outstanding Innovation Award from IBM Corporation. He has also been named Faculty of the Year by the Association of Computer Science Undergraduates at Cornell.

He is known for his seminal work at the intersection of logic and complexity. He is one of the fathers of dynamic logic[2] and developed the version of the mu calculus most used today.[3] Moreover, he has written several textbooks on the theory of computation,[4] automata theory, dynamic logic, and algorithms.

Kozen was also the guitarist, singer, and songwriter of the band "Harmful if Swallowed." He also holds the position of faculty advisor for Cornell's Rugby Football club[5] and plays for the Cortland Homer Thundering Herd rugby team.

References

  1. ^ Dexter Kozen at the Mathematics Genealogy Project.
  2. ^ David Harel, Dexter Kozen, and Jerzy Tiuryn, "Dynamic Logic". MIT Press, 2000.
  3. ^ Dexter Kozen (1983). "Results on the Propositional μ-Calculus". Theoretical Computer Science 27 (3): 333–354.
  4. ^ Dexter Kozen (2006). Theory of Computation. Springer. ISBN 1-84628-297-7.
  5. ^ http://www.curfc.com/teamcontacts.php

External links


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Regular expression — In computing, a regular expression provides a concise and flexible means for matching (specifying and recognizing) strings of text, such as particular characters, words, or patterns of characters. Abbreviations for regular expression include… …   Wikipedia

  • Kleene algebra — In mathematics, a Kleene algebra (named after Stephen Cole Kleene, IPAEng|ˈkleɪni as in clay knee ) is either of two different things:* A bounded distributive lattice with an involution satisfying De Morgan s laws, and the inequality x ∧− x ≤ y… …   Wikipedia

  • Modal μ-calculus — In theoretical computer science, the modal μ calculus (also μ calculus, but this can have a more general meaning) is an extension of propositional modal logic (with many modalities) by adding a least fixpoint operator μ and a greatest fixpoint… …   Wikipedia

  • Algebre de Kleene — Algèbre de Kleene En mathématiques, une algèbre de Kleene (du nom du logicien américain Stephen Cole Kleene) correspond à l un des deux concepts suivants : Un treillis ordonné et distributif avec une involution satisfaisant les lois de De… …   Wikipédia en Français

  • Algèbre De Kleene — En mathématiques, une algèbre de Kleene (du nom du logicien américain Stephen Cole Kleene) correspond à l un des deux concepts suivants : Un treillis ordonné et distributif avec une involution satisfaisant les lois de De Morgan et l… …   Wikipédia en Français

  • Algèbre de Kleene — Pour les articles homonymes, voir Algèbre (homonymie). En mathématiques, une algèbre de Kleene (du nom du logicien américain Stephen Cole Kleene) correspond à l un des deux concepts suivants : Un treillis ordonné et distributif avec une… …   Wikipédia en Français

  • Algèbre de kleene — En mathématiques, une algèbre de Kleene (du nom du logicien américain Stephen Cole Kleene) correspond à l un des deux concepts suivants : Un treillis ordonné et distributif avec une involution satisfaisant les lois de De Morgan et l… …   Wikipédia en Français

  • Dynamic logic (modal logic) — For the subject in digital electronics also known as clocked logic, see dynamic logic (digital electronics). Dynamic logic is an extension of modal logic originally intended for reasoning about computer programs and later applied to more general… …   Wikipedia

  • Алгебра Клини — в теоретической информатике, специальная алгебраическая структура, введённая американским математиком Стивеном Клини, являющаяся обобщением алгебры регулярных выражений. Определение Алгеброй Клини называется алгебра сигнатуры , являющаяся… …   Википедия

  • NC (complexity) — Unsolved problems in computer science Is NC = P ? In complexity theory, the class NC (for Nick s Class ) is the set of decision problems decidable in polylogarithmic time on a parallel computer with a polynomial number of processors. In… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”