Dana Stewart Scott (born October 11, 1932) is an American logician who is the emeritus Hillman University Professor of

Computer Science Computer science is the study of computation, information, and automation. Computer science spans Theoretical computer science, theoretical disciplines (such as algorithms, theory of computation, and information theory) to Applied science, ...

Philosophy Philosophy ('love of wisdom' in Ancient Greek) is a systematic study of general and fundamental questions concerning topics like existence, reason, knowledge, Value (ethics and social sciences), value, mind, and language. It is a rational an ...

, and

Mathematical Logic Mathematical logic is the study of Logic#Formal logic, formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory (also known as computability theory). Research in mathematical logic com ...

Carnegie Mellon University Carnegie Mellon University (CMU) is a private research university in Pittsburgh, Pennsylvania, United States. The institution was established in 1900 by Andrew Carnegie as the Carnegie Technical Schools. In 1912, it became the Carnegie Institu ...

; he is now retired and lives in

Berkeley, California Berkeley ( ) is a city on the eastern shore of San Francisco Bay in northern Alameda County, California, United States. It is named after the 18th-century Anglo-Irish bishop and philosopher George Berkeley. It borders the cities of Oakland, Cali ...

. His work on automata theory earned him the

Turing Award The ACM A. M. Turing Award is an annual prize given by the Association for Computing Machinery (ACM) for contributions of lasting and major technical importance to computer science. It is generally recognized as the highest distinction in the fi ...

in 1976, while his collaborative work with

Christopher Strachey Christopher S. Strachey (; 16 November 1916 – 18 May 1975) was a British computer scientist. He was one of the founders of denotational semantics, and a pioneer in programming language design and computer time-sharing.F. J. Corbató, et al., T ...

in the 1970s laid the foundations of modern approaches to the

semantics of programming languages In programming language theory, semantics is the rigorous mathematical study of the meaning of programming languages. Semantics assigns computational meaning to valid strings in a programming language syntax. It is closely related to, and oft ...

. He has also worked on

modal logic Modal logic is a kind of logic used to represent statements about Modality (natural language), necessity and possibility. In philosophy and related fields it is used as a tool for understanding concepts such as knowledge, obligation, and causality ...

topology Topology (from the Greek language, Greek words , and ) is the branch of mathematics concerned with the properties of a Mathematical object, geometric object that are preserved under Continuous function, continuous Deformation theory, deformat ...

, and

category theory Category theory is a general theory of mathematical structures and their relations. It was introduced by Samuel Eilenberg and Saunders Mac Lane in the middle of the 20th century in their foundational work on algebraic topology. Category theory ...

Early career

He received his B.A. in Mathematics from the

University of California, Berkeley The University of California, Berkeley (UC Berkeley, Berkeley, Cal, or California), is a Public university, public Land-grant university, land-grant research university in Berkeley, California, United States. Founded in 1868 and named after t ...

, in 1954. He wrote his Ph.D. thesis on ''Convergent Sequences of Complete Theories'' under the supervision of

Alonzo Church Alonzo Church (June 14, 1903 – August 11, 1995) was an American computer scientist, mathematician, logician, and philosopher who made major contributions to mathematical logic and the foundations of theoretical computer science. He is bes ...

while at Princeton, and defended his thesis in 1958. Solomon Feferman (2005) writes of this period: After completing his Ph.D. studies, he moved to the

University of Chicago The University of Chicago (UChicago, Chicago, or UChi) is a Private university, private research university in Chicago, Illinois, United States. Its main campus is in the Hyde Park, Chicago, Hyde Park neighborhood on Chicago's South Side, Chic ...

, working as an instructor there until 1960. In 1959, he published a joint paper with Michael O. Rabin, a colleague from Princeton, titled ''Finite Automata and Their Decision Problem'' (Scott and Rabin 1959) which introduced the idea of nondeterministic machines to automata theory. This work led to the joint bestowal of the

on the two, for the introduction of this fundamental concept of

computational complexity theory In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and explores the relationships between these classifications. A computational problem ...

University of California, Berkeley, 1960–1963

Scott took up a post as Assistant Professor of Mathematics, back at the

, and involved himself with classical issues in

mathematical logic Mathematical logic is the study of Logic#Formal logic, formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory (also known as computability theory). Research in mathematical logic com ...

, especially

set theory Set theory is the branch of mathematical logic that studies Set (mathematics), sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory – as a branch of mathema ...

and Tarskian

model theory In mathematical logic, model theory is the study of the relationship between theory (mathematical logic), formal theories (a collection of Sentence (mathematical logic), sentences in a formal language expressing statements about a Structure (mat ...

. He proved that the axiom of constructibility is incompatible with the existence of a measurable cardinal, a result considered ''seminal'' in the evolution of set 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'').

Modal and tense logic

Scott also began working on

in this period, beginning a collaboration with John Lemmon, who moved to Claremont, California, in 1963. Scott was especially interested in Arthur Prior's approach to tense logic and the connection to the treatment of time in natural-language semantics, and began collaborating with

Richard Montague Richard Merritt Montague (September 20, 1930 – March 7, 1971) was an American mathematician and philosopher who made contributions to mathematical logic and the philosophy of language. He is known for proposing Montague grammar to formalize th ...

(Copeland 2004), whom he had known from his days as an undergraduate at Berkeley. Later, Scott and Montague independently discovered 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 the ''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 & Scott, 1977).

Stanford, Amsterdam and Princeton, 1963–1972

Following an initial observation of Robert Solovay, Scott formulated the concept of Boolean-valued model, as 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.

University of Oxford, 1972–1981

Scott took up a post as Professor of Mathematical Logic on the Philosophy faculty of the

University of Oxford The University of Oxford is a collegiate university, collegiate research university in Oxford, England. There is evidence of teaching as early as 1096, making it the oldest university in the English-speaking world and the List of oldest un ...

in 1972. He was member of Merton College while at Oxford and is now an Honorary Fellow of the college.

Semantics of programming languages

This period saw Scott working with

, and the two managed, despite administrative pressures, to do 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 In computer science, denotational semantics (initially known as mathematical semantics or Scott–Strachey semantics) is an approach of formalizing the meanings of programming languages by constructing mathematical objects (called ''denotations'' ...

, an important and seminal contribution to

theoretical computer science Theoretical computer science is a subfield of computer science and mathematics that focuses on the Abstraction, abstract and mathematical foundations of computation. It is difficult to circumscribe the theoretical areas precisely. The Associati ...

. One of Scott's contributions is his formulation of

domain theory Domain theory is a branch of mathematics that studies special kinds of partially ordered sets (posets) commonly called domains. Consequently, domain theory can be considered as a branch of order theory. The field has major applications in computer ...

, allowing programs involving recursive functions and looping-control constructs to be given denotational semantics. Additionally, he provided a foundation for the understanding of infinitary and continuous information through domain theory and his theory of

information systems An information system (IS) is a formal, sociotechnical, organizational system designed to collect, process, store, and distribute information. From a sociotechnical perspective, information systems comprise four components: task, people, structu ...

. 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 The Royal Swedish Academy of Sciences () is one of the Swedish Royal Academies, royal academies of Sweden. Founded on 2 June 1739, it is an independent, non-governmental scientific organization that takes special responsibility for promoting nat ...

for ''his conceptually oriented logical works, especially the creation of domain theory, which has made it possible to extend Tarski's semantic 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

, Scott proposed the theory of equilogical spaces as a successor theory to domain theory; among its many advantages, the category of equilogical spaces is a

cartesian closed category In category theory, a Category (mathematics), category is Cartesian closed if, roughly speaking, any morphism defined on a product (category theory), product of two Object (category theory), objects can be naturally identified with a morphism defin ...

, whereas the category of domains is not. In 1994, he was inducted as a

Fellow A fellow is a title and form of address for distinguished, learned, or skilled individuals in academia, medicine, research, and industry. The exact meaning of the term differs in each field. In learned society, learned or professional society, p ...

of the

Association for Computing Machinery The Association for Computing Machinery (ACM) is a US-based international learned society for computing. It was founded in 1947 and is the world's largest scientific and educational computing society. The ACM is a non-profit professional membe ...

. In 2012 he became a fellow of the

American Mathematical Society The American Mathematical Society (AMS) is an association of professional mathematicians dedicated to the interests of mathematical research and scholarship, and serves the national and international community through its publications, meetings, ...

.List of Fellows of the American Mathematical Society
retrieved 2013-07-14.

Bibliography

* 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 on modal logic'. In ''Philosophical Problems in Logic'', ed. K. Lambert, pages 143–173. * With John Lemmon, 1977. ''An Introduction to Modal Logic''. Oxford: Blackwell. *

References

External links

* *
DOMAIN 2002 Workshop on Domain Theory
' — held in honor of Scott's 70th birthday. * * * Dana Scott interviewed by Gordon Plotkin, as part of the

series of interviews of Turing award winners
Part 1 (Nov 12, 2020)Part 2 (Dec 29, 2020)Part 3 (Jan 12, 2021)Part 4 (Feb 18, 2021)
*
Selected papers of Dana S. Scott
' {{DEFAULTSORT:Scott, Dana American computer scientists American logicians 1932 births Living people Members of the United States National Academy of Sciences Carnegie Mellon University faculty 1994 fellows of the Association for Computing Machinery Fellows of the American Mathematical Society Fellows of Merton College, Oxford Formal methods people Lattice theorists Mathematical logicians Modal logicians Model theorists Programming language researchers Rolf Schock Prize laureates Semanticists Set theorists American topologists Turing Award laureates University of Chicago faculty University of California, Berkeley College of Letters and Science faculty Princeton University alumni UC Berkeley College of Letters and Science alumni People from Berkeley, California Engineers from California Scientists from California 20th-century American mathematicians 20th-century American engineers 21st-century American engineers 20th-century American scientists 21st-century American scientists 21st-century American mathematicians