Dana Scott

Dana Stewart Scott
Dana Stewart Scott
Born	October 11, 1932; Berkeley, California
Education	UC Berkeley (B.A., 1954) Princeton University (Ph.D., 1958)
Known for	Automata theory; Cartesian monoid; Logic of Computable Functions; Semantics of programming languages; Modal μ-calculus; Nondeterministic finite automaton; Scott domain; Scott encoding; Scott information system; Scott topology; Scott's trick; Scott-Montague semantics; Scott–Potter set theory; Scott–Strachey semantics; Rabin–Scott powerset construction;
Awards	Leroy P. Steele Prize (1972); Turing Award (1976); Tarski Lectures (1989); Harold Pender Award (1990); Gödel Lecture (1991); Rolf Schock Prize (Logic and Philosophy) (1997);
	Scientific career
Fields	Computer science; Mathematics; Philosophy;
Institutions	University of Chicago; UC Berkeley; Stanford; Merton College, University of Oxford; Carnegie Mellon University;
Thesis	Convergent Sequences of Complete Theories (1958)
Doctoral advisor	Alonzo Church
Doctoral students	Jack Copeland; Michael Fourman; Kenneth Kunen; Angus Macintyre; Peter Mosses; Ketan Mulmuley; Marko Petkovšek; Fred S. Roberts; David Turner; Martin Davies;

Dana Stewart Scott (born October 11, 1932) is an American logician who is the emeritus Hillman University Professor of Computer Science, Philosophy, and Mathematical Logic at Carnegie Mellon University; he is now retired and lives in Berkeley, California. His work on automata theory earned him the Turing Award in 1976, while his collaborative work with Christopher Strachey in the 1970s laid the foundations of modern approaches to the semantics of programming languages. He has also worked on modal logic, topology, and category theory.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.