Mathematician:Dana Stewart Scott

From ProofWiki
(Redirected from Mathematician:D.S. Scott)
Jump to navigation Jump to search


American computer scientist, logician and philosopher.




  • Born: October 11, 1932
  • 1954: Received BA in Mathematics from University of California, Berkeley
  • 1958: Completed Ph.D. at Princeton, moved to University of Chicago
  • 1960: Assistant Professor of Mathematics, University of California, Berkeley
  • 1963: Began collaboration with John Lemmon
  • 1972: Awarded LeRoy P. Steele Prize for A Proof of the Independence of the Continuum Hypothesis
  • 1972: Professor of Mathematical Logic on the Philosophy faculty of Oxford University
  • 1976: Turing Award (with Michael Rabin)
  • 1990: Harold Pender Award for Application of Concepts ... Programming Languages
  • 1994: Inducted as a Fellow of the Association for Computing Machinery
  • 1997: Rolf Schock Prize in Logic and Philosophy
  • 2001: Bolzano Medal for Merit in the Mathematical Sciences

Theorems and Definitions

Definitions of concepts named for Dana Stewart Scott can be found here.


  • 1958: Convergent Sequences of Complete Theories (Ph.D. thesis)
  • 1959: Finite Automata and Their Decision Problem (with Michael O. Rabin)
  • 1967: A proof of the independence of the continuum hypothesis
  • 1970: Advice in modal logic (in Philosophical Problems in Logic, ed. K. Lambert)
  • 1977: An introduction to modal logic (with John Lemmon)
  • 1980: A Compendium of Continuous Lattices (with G. Gierz, K.H. Hofmann, K. Keimel, J.D. Lawson and M.W. Mislove)
  • 1990: Application of Concepts from Logic and Algebra to the Development of Mathematical Semantics of Programming Languages
  • December 1996: A New Category? Domains, Spaces and Equivalence Relations