Dana Scott

Dana Stewart Scott

Born	(1932-10-11) October 11, 1932 Berkeley, California
Education	University of California, Berkeley (BA) Princeton University (MA, PhD)
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 University of California, Berkeley Stanford Merton College, 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 Roy Dyckhoff Ketan Mulmuley Marko Petkovšek Fred S. Roberts David Turner Martin Davies Krister Segerberg Andrej Bauer Joseph Almog

Dana Stewart Scott (born October 11, 1932) is an American logician who is the Hillman University Professor emeritus of Computer Science, Philosophy, and Mathematical Logic at Carnegie Mellon University. He is now retired and lives in Berkeley, California. He and Michael O. Rabin won the 1976 ACM Turing Award for their work on automata theory, 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.