Skip to content
Dana Scott

Image by Efraimstochter on Pixabay · Pixabay License

EntityQ49823· pop 37· linked from 318 articles

Dana Scott

Sign in to save

Also known as Dana S. Scott, Dana Stewart Scott

American mathematician and computer scientist

OverviewAI-generated

Dana Stewart Scott is an American mathematician, computer scientist, engineer, and topologist born in Berkeley in 1932. He holds a Doctor of Philosophy and was educated at Princeton University and the University of California, Berkeley. His doctoral advisor was Alonzo Church, and he has supervised doctoral students including Jack Copeland, Kenneth Kunen, Angus Macintyre, and Fred S. Roberts.

Scott has worked at the University of California, Berkeley, University of Chicago, Carnegie Mellon University, and Johannes Kepler University Linz. His research fields include lattice theory, mathematical logic, model theory, and topology. Notable works include *Lectures on a mathematical theory of computation*, *Notes on the formalization of logic*, *Continuous lattices*, and *The lattice of flow diagrams*.

He is a member of the National Academy of Sciences, Academia Europaea, the Finnish Academy of Science and Letters, and the American Academy of Arts and Sciences. Scott has received the Turing Award, Guggenheim Fellowship, Harold Pender Award, and Leroy P. Steele Prize. He speaks English and is related to Otto Schreier.

Synthesized by Vinony from 25 facts across 3 sources: Wikidata, Open Library, Vinony collections. Generated from structured data (not the Wikipedia text) and checked against those facts — may still contain errors.

In the Vinony graph

Dana Scott is indexed among the 79 entries in Vinony's Turing Award collection. It also appears in American Academy of Arts & Sciences.

Vinony's link graph records 318 inbound references to Dana Scott, and connects out to Rolf Schock Prizes, European Association for Theoretical Computer Science and Scott continuity.

It sits within the topics 1932 births, 20th-century American engineers and 20th-century American mathematicians.

Vinony links it to 36 Wikipedia language editions.

Person · Open Library

Works
4

Top works

  • Lectures on a mathematical theory of computation
  • Notes on the formalization of logic
  • Continuous lattices
  • The lattice of flow diagrams

via Open Library + Wikidata

Key facts

Born
( 1932-10-11 ) October 11, 1932 (age 93) , Berkeley, California
Education
University of California, Berkeley ( BA ), Princeton University ( MA , PhD)
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)
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 [ sv ] Andrej Bauer [ sl ] Joseph Almog [ fi ]

via Wikipedia infobox

Wikidata facts

Instance of
human
Given name
Dana
Family name
Scott
Gender
male
Citizenship
United States
Place of birth
Berkeley
Languages spoken
English language
Academic degree
Doctor of Philosophy
Doctoral advisor
Alonzo Church
Official website
www.cs.cmu.edu/~scott
Image
Scott Dana small.jpg
Show 7 more facts
Commons category
Dana Scott
date of birth
1932-10-11
Erdős number
3
name in native language
Dana Stewart Scott
maintained by WikiProject
WikiProject Mathematics
Sources (5)

via Wikidata · CC0

~8 min read

Encyclopedic overview

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.

Early career

Excerpted from Wikipedia’s “Dana Scott” article, available under the CC BY-SA 4.0 licence.

Connections

Categories