Dana Scott 161875 214374952 2008-05-23T07:33:14Z Doczilla 881880 clean up; remove deleted category using [[Project:AutoWikiBrowser|AWB]] {{Infobox_Scientist | name = Dana Stewart Scott | image = Scott Dana small.jpg | image_width = | caption = | birth_date = [[1932]] | birth_place = | death_date = | death_place = | residence = | citizenship = | nationality = | ethnicity = | field = [[Computer Science]]<br>[[Mathematics]]<br>[[Philosophy]] | work_institution = [[University of California, Berkeley]]<br>[[Oxford University]]<br>[[Carnegie Mellon University]] | alma_mater = | doctoral_advisor = | doctoral_students = | known_for = | author_abbreviation_bot = | author_abbreviation_zoo = | prizes = [[ACM Turing Award]] 1976, [http://math.berkeley.edu/events_series_tarski.html Tarski lectures] 1989 | religion = | footnotes = }} '''Dana Stewart Scott''' (born [[1932]]) is the emeritus ''Hillman University Professor of [[computer science|Computer Science]], [[Philosophy]], and [[mathematical logic|Mathematical Logic]]'' at [[Carnegie Mellon University]]; he is now retired and lives in [[Berkeley, California]]. His research career has spanned [[computer science]], [[mathematics]], and [[philosophy]], and has been characterized by a marriage of a concern for elucidating fundamental concepts in the manner of informal rigor, with a cultivation of mathematically hard problems that bear on these concepts. His work on [[automata theory]] earned him the [[ACM 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 worked also on [[modal logic]], [[topology]], and [[category theory]]. He is the editor-in-chief of the new journal [[Logical Methods in Computer Science]]. ==Early career== He received his [[Bachelor of Arts|BA]] in Mathematics from the [[University of California, Berkeley]] in [[1954]]. He wrote his [[Doctor of Philosophy|Ph.D. thesis]] on ''Convergent Sequences of Complete Theories'' under the supervision of [[Alonzo Church]] while at Princeton, and defended his thesis in [[1958]]. After completing his Ph.D. studies, he moved to the [[University of Chicago]], working as an instructor there until 1960. In [[1959]], he published a joint paper with [[Michael O. Rabin]], a colleague from Princeton, entitled ''Finite Automata and Their Decision Problem'', which introduced the idea of nondeterministic machines to [[automata theory]]. This work led to the joint bestowal of the [[Turing Award]] on the two, for the introduction of this fundamental concept of [[computational complexity theory]]. ==University of California, Berkeley, [[1960]]&ndash;[[1963]]== <!-- [02] Assistant Professor of Mathematics, University of California, Berkeley [03] Associate Professor of Mathematics, University of California, Berkeley James Halpern University of California, Berkeley 1962 12 [01] E.G.K. Lopez-Escobar, U.C. Berkeley, 1965 [Math] *5 [02] Peter Perkins, U.C. Berkeley, 1966 [Math] * [03] Peter H. Krauss, U.C. Berkeley, 1966 [Math] * Daniel Demaree University of California, Berkeley 1970 [13] ?Daniel Gallin, U.C. Berkeley, 1972 [Math] * --> Scott took up a post as Assistant Professor of Mathematics, at the [[University of California, Berkeley]], the university of [[Alfred Tarski]], and involved himself with classical issues in [[mathematical logic]], especially [[set theory]] and Tarskian [[model theory]]. During this period he started supervising Ph.D. students, such as James Halpern (''Contributions to the Study of the Independence of the Axiom of Choice'') and [[Edgar Lopez-Escobar]] (''Infinitely Long Formulas with Countable Quantifier Degrees''). Scott's work as research supervisor has been an important source of his intellectual influence. ===Modal logic=== Scott also began working on [[modal logic]] in this period, beginning a collaboration with [[John Lemmon]], who moved to [[Claremont, California]] in [[1963]]. Scott was especially interested in [[tense logic]] and the connection to the treatment of time in natural-language semantics, and began collaborating with [[Richard Montague]] (Copeland 2004). Later, Scott and Montague were independently to discover an important generalisation of [[Kripke semantics]] for modal and tense logic called [[Scott-Montague semantics]] (Scott 1970). John Lemmon and Scott began work on a modal-logic textbook that was interrupted by Lemmon's death in [[1966]]. Scott circulated the incomplete monograph amongst colleagues, introducing a number of important techniques in the semantics of model theory, most importantly presenting a refinement of ''canonical model'' that became standard, and introducing the technique of constructing models through ''filtrations'', both of which are core concepts in modern [[Kripke semantics]] (Blackburn, de Rijke, and Venema, 2001). Scott eventually published the work as ''An Introduction to Modal Logic'' (Lemmon and Scott, 1977). ==Stanford, Amsterdam and Princeton, [[1963]]&ndash;[[1972]]== <!-- [04] Associate Professor of Logic and Mathematics, Stanford University 1963-67 [05] Professor of Logic and Mathematics, Stanford University 1967-69 [06] Visiting Professor of Mathematics, University of Amsterdam 1968-69 [07] Professor of Philosophy and Mathematics, Princeton University 1969-72 [04] Nicolas D. Goodman, Stanford, 1968 [Phil] *1 [05] Angus Macintyre, Stanford, 1968 [Math] *16 [06] William C. Rounds, Stanford, 1968 [Math] *10 [07] William Ogden, Stanford, 1968 [Math] (1969)* [08] Kenneth Kunen, Stanford, 1968 [Math] *29 [09] Fred S. Roberts, Stanford, 1968 [Math] *10 [10] Brian F. Chellas, Stanford, 1969 [Phil] [11] Richard B. Mansfield, Stanford, 1969 [Math] *1 [12] Krister Segerberg, Stanford, 1971 [Phil] [13] ?Daniel Gallin, U.C. Berkeley, 1972 [Math] * [14] William J. Meyer, Stanford, 1974 [Math] [15] Shun-On Adrian Tang, Princeton, 1974 [Math] --> Following an initial observation of [[Robert Solovay]], Scott formulated the concept of [[Boolean-valued model]] (Solovay and [[Petr Vopěnka]] did likewise at around the same time). In [[1967]] Scott published a paper, ''A Proof of the Independence of the Continuum Hypothesis'', in which he used Boolean-valued models to provide an alternate analysis of the independence of the [[continuum hypothesis]] to that provided by [[Paul Cohen]]. This work led to the award of the [[Leroy P. Steele Prize]] in [[1972]]. ==Oxford University, [[1972]]&ndash;[[1981]]== <!-- [08] Professor of Mathematical Logic, Oxford University 1972-81 Roy Dyckhoff University of Oxford 1974 5 David Turner University of Oxford 1981 3 [16] Michael P. Fourman, Oxford, 1974 [Math] [17] Michael Katz, Oxford, 1976 [Math] [18] Jay David Atlas, Princeton, 1976 [Phil] [19] Martin K. Davies, Oxford, 1977 [Phil] [20] Robin John Grayson, July, 1978 [Phil] [21] William Bragg Ewald, Oxford, 1978 [Phil] [22] John Cartmell, Oxford, 1979 [Math] [23] Brian J. Copeland, Oxford, 1979 [Phil] [24] Michael B. Smyth, Oxford, 1980 [Math] [25] Joseph E. Quinsey, Oxford, 1980 [Math] [26] Stephen R. Blamey, Oxford, 1980 [Phil] [27] Marcus Giaquinto, Oxford, 1983 [Phil] [28] Joseph Almog, Oxford, 1983 [Phil] [29] Felipe Bracho, Oxford, 1984 [Math] [30] David Charles McCarty, Oxford, 1985 [Math] ... [33] Sidney C. Bailin, Oxford, 1986 [Math] [34] Giuseppe Rosolini, Oxford, 1986 [Math] --> Scott took up a post as Professor of Mathematical Logic on the Philosophy faculty of [[Oxford University]] in [[1972]]. ===Semantics of programming languages=== This period saw Scott working closely with [[Christopher Strachey]], and the two managed, despite intense administrative pressures, to oversee a great deal of fundamental work on providing a mathematical foundation for the semantics of programming languages, the work for which Scott is best known. Together, their work constitutes the Scott-Strachey approach to [[denotational semantics]]; it constitutes one of the most influential pieces of work in [[theoretical computer science]] and can perhaps be regarded as founding one of the major schools of [[computer science]]. One of Scott's largest contributions is his formulation of [[domain theory]], allowing programs involving recursive functions and looping-control constructs to be given a denotational semantics. Additionally, he provided a foundation for the understanding of infinitary and continuous information through domain theory and his theory of [[Scott information system|information systems]]. Scott's work of this period led to the bestowal of: *The [[1990]] [[Harold Pender Award]] for his ''application of concepts from logic and algebra to the development of mathematical semantics of programming languages''; *The [[1997]] [[Rolf Schock Prize]] in logic and philosophy from the [[Royal Swedish Academy of Sciences]] for ''his conceptually oriented logical works, especially the creation of domain theory, which has made it possible to extend Tarski's semantical paradigm to programming languages as well as to construct models of Curry's combinatory logic and Church's calculus of lambda conversion''; and *The [[2001]] [[Bolzano Prize]] for Merit in the Mathematical Sciences by the [[Czech Academy of Sciences]]. *The [[2007]] [[EATCS]] Award for his contribution to theoretical computer science. ==Carnegie Mellon University [[1981]]–[[2003]]== <!-- [09] University Professor of Computer Science, Mathematical Logic, and Philosophy, Carnegie Mellon University 1981-03 [10] Hillman Professor of Computer Science, Carnegie Mellon University 1989-03 [11] Visiting O.Univ.Prof. Math., Universitaets Linz 1992-93 [12] Professor Emeritus July 2003 Ljubomir Perkovic Carnegie-Mellon University 1998 [31] Carl Gunter, U. Wisconsin, 1985 [CSci] [32] Ketan Mulmuley, Carnegie Mellon, 1985 [CSci] *1 [35] Vijay Anand Saraswat, Carnegie Mellon, 1988 [CSci] (1989)* [36] Marko Petkovsek, Carnegie Mellon, 1991 [CSci] *1 [37] Kim Ritter Wagner, Carnegie Mellon, 1994 [CSci] * [38] J. Todd Wilson, Carnegie Mellon, 1994 [CSci] * [39] Lars Birkedal, Carnegie Mellon, 1999 [CSci] * [40] Andrej Bauer, Carnegie Mellon, 2000 [CSci] * [41] Jesse Hughes, Carnegie Mellon, 2001 [Phil] * --> At [[Carnegie Mellon University]], Scott proposed the theory of [[equilogical spaces]] as a generalization of domain theory. In 1994 he was inducted as a [[Fellow]] of the [[Association for Computing Machinery]]. ==References== ===Works by Scott=== * With [[Michael O. Rabin]], 1959. ''Finite Automata and Their Decision Problem''. * 1967. ''A proof of the independence of the continuum hypothesis''. Mathematical Systems Theory 1:89-111. * 1970. 'Advice in modal logic'. In ''Philosophical Problems in Logic'', ed. K. Lambert, pages 143-173. * With [[John Lemmon]], 1977. ''An Introduction to Modal Logic''. Oxford: Blackwell. ===Other works=== *Blackburn, de Rijke and Venema, 2001. ''Modal logic''. Cambridge University Press. *[[Jack Copeland]], 2004. [http://plato.stanford.edu/entries/prior/ Arthur Prior]. In the [[Stanford Encyclopedia of Philosophy]]. * Joseph E. Stoy, ''Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory'', MIT Press, 1977. ISBN 0-262-19147-4 ==External links== * [http://www-2.cs.cmu.edu/~scott/ Dana S. Scott's home page] * ''[http://floc02.diku.dk/DOMAIN/ DOMAIN 2002 Workshop on Domain Theory]'' &ndash; held in honor of Scott's 70th birthday. * {{MathGenealogy|id=8024}} {{Schock Prize laureates}} {{Turing award}} <!-- Metadata: see [[Wikipedia:Persondata]] --> {{Persondata |NAME= Scott, Dana Stewart |ALTERNATIVE NAMES= |SHORT DESCRIPTION= Emeritus Professor of [[Computer Science]], [[mathematics]], and [[philosophy]] |DATE OF BIRTH= [[1932]] |PLACE OF BIRTH= |DATE OF DEATH= |PLACE OF DEATH= }} {{DEFAULTSORT:Scott, Dana}} [[Category:1932 births]] [[Category:Members of the National Academy of Sciences]] [[Category:20th century mathematicians]] [[Category:American computer scientists]] [[Category:American mathematicians]] [[Category:Carnegie Mellon University faculty]] [[Category:Fellows of the Association for Computing Machinery]] [[Category:Formal methods people]] [[Category:Programming language researchers]] [[Category:Living people]] [[Category:Logicians]] [[Category:Princeton University alumni]] [[Category:Rolf Schock Prize laureates]] [[Category:Turing Award laureates]] [[Category:University of California, Berkeley alumni]] [[Category:University of California, Berkeley faculty]] [[de:Dana Scott]] [[es:Dana Scott]] [[fr:Dana S. Scott]] [[id:Dana Scott]] [[it:Dana Scott]] [[ja:デイナ・スコット]] [[pl:Dana Scott]] [[ru:Скотт, Дана Стюарт]] [[fi:Dana Scott]]