Dana Stewart Scott ( born Dana Stewart Scott , b. October 11, 1932 ) is an American mathematician known for his work in the field of mathematical logic and computer science .
| Dana Scott | |
|---|---|
| Dana stewart scott | |
 | |
| Date of Birth | |
| Place of Birth | |
| A country | |
| Scientific field | Topology Mathematical logic Programming |
| Place of work | |
| Alma mater | |
| Academic degree | ( 1958 ) |
| supervisor | Alonzo Church |
| Known as | Scott topology |
| Awards and prizes | Steel Award (1972) Turing Award (1976) Harold Pender Prize (1990) Rolf Shock Award (1997) |
| Site | |
Scott's research is related to model theory, automata theory , modal and intuitionistic logics, constructive mathematics, and the relationship between logic and category theory . Philosophical interests lie in the field of the foundations of logic , the philosophy of mathematics and the semantic analysis of natural languages .
He made a major contribution to the development of computer science by developing a mathematical theory of computation [1] . He developed a model of typeless λ-calculus [2] , for which he introduced a special topology (later named after him), first on full lattices , and subsequently generalized to complete partially ordered sets [3] [4] . Within the framework of this model, he developed the theory and models of computations, developed the principles of programming languages , and deepened the concept of computability .
As of 2012, he works and lives in Berkeley, California .
Rewards
- In 1972, he received the Steel Prize for his work published in 1967 - proof of the independence of the continuum hypothesis , an alternative to the proof of Paul Cohen .
- In 1976, with Michael Rabin, he became a Turing Prize laureate, their article “ Finite Automata ” was awarded, which proposed the idea of a non-deterministic automaton, a concept that subsequently proved to be of exceptional value [5] .
- In 1990, he was awarded the Harold Pender Prize as an innovator in the application of concepts from logic and algebra to the development of mathematical semantics of programming languages [6] .
- In 1997, in the nomination “Logic and Philosophy” he received the Rolf Shock Prize for conceptually oriented logical work, especially on the creation of , which made it possible to apply to programming languages, as well as to construct models of combinatorial logic Curry and Church's lambda calculus [7] .
- In 2001, he won the Bolzano Prize from the Czech Academy of Sciences for his achievements in mathematics.
- In 2007, he received an award from the European Association for Theoretical Informatics in recognition of his contribution to theoretical informatics and a productive scientific career [8] [9] .
- In 2009, the Institute of Mathematics of the SB RAS awarded the scientist a gold medal for his contribution to mathematics [10] .
- Honorary Doctor of the University of St. Andrews (2014).
Major works
- Scott DS Advice on modal logic. - Philosophical problems in logic. Some recent developments .-- Lambert K. (ed.), Dordrecht; Holland: Reidel, 1970.
- Russian translation: Scott D. S. Advice on modal logic. - In the book: Semantics of modal and intensional logics. - Under. ed. Doctor of Philosophy V. A. Smirnova . - M .: `` Progress , 1981. - p. ~ 280-317.
- Scott DS, Strachey C. Towards a mathematical semantics for computer languages. - In: Proc. Symp on Computers and Automata, Polytechnic Institute of Brooklyn, 21, 1971. - pp. ~ 19–46.
- Scott DS Logic and programming languages. - Comm. Assoc. for comp. Mach. 20, 1977. - pp. 634–641.
- Russian translation: Scott D. S. Logic and programming languages. - Lectures of Turing Prize winners (eds .: Eschenhurst R. ). - M .: Mir, 1993 .-- pp. ~ 65-83.
- Scott DS Relating theories of the lambda calculus. - Hindley J., Seldin J. (eds.) To HBCurry: Essays on combinatory logic, lambda calculus and formalism .-- NY & L .: Academic Press, 1980, pp. ~ 403-450.
Notes
- ↑ Scott DS Outline of mathematical theory of computation. In: Proc. 4th Annual Princeton Conf. on Information Sciences and Systems, Princeton University, 1970. - pp. ~ 169-176.
- ↑ Scott DS Lattice-theoretic models for various type-free calculi. - In: Proc. 4th Int. Congress for Logic, Methodology, and the Philosophy of Science, Bucharest, 1972.
- ↑ Scott DS The lattice of flow diagrams .-- Lecture Notes in Mathematics, 188, Symposium on Semantics of Algorithmic Languages .-- Berlin, Heidelberg, New York: Springer-Verlag, 1971, pp. ~ 311-372.
- ↑ Barendregt, Henk . Lambda calculus. Its syntax and semantics = The Lambda Calculus. Its syntax and semantics (Russian) . - M .: Mir , 1985.- S. 24. - 606 p. - 4800 copies.
- ↑ AM Turing Award Winners by Dana Stewart Scott // ACM
- ↑ The Harold Pender Award (link not available) . Date of treatment November 10, 2015. Archived February 22, 2012.
- ↑ Rolf Shock prizes
- ↑ European Association for Theoretical Computer Science
- ↑ EATCS Award (Monday, 9th)
- ↑ Carnegie Mellon University .
See also
- Computation Models
- Theory of Computing
- Lambda calculus with types
Links
- About Dan Stuart Scott at Encyclopaedia Britannica
- Carnegie Mellon's Dana Scott Awarded Sobolev Institute Gold Medal . Carnegie Mellon University (April 13, 2009).