Dana Scott
#362
Most Influential Person Now
American mathematician and computer scientist
Dana Scott's AcademicInfluence.com Rankings
Dana Scottcomputer-science Degrees
Computer Science
#60
World Rank
#62
Historical Rank
#35
USA Rank
Theoretical Computer Science
#5
World Rank
#5
Historical Rank
#4
USA Rank
Dana Scottmathematics Degrees
Mathematics
#102
World Rank
#271
Historical Rank
#38
USA Rank
Measure Theory
#291
World Rank
#452
Historical Rank
#129
USA Rank
Download Badge
Computer Science Mathematics
Dana Scott's Degrees
- Bachelors Mathematics University of California, Berkeley
- PhD Mathematics Princeton University
Similar Degrees You Can Earn
Why Is Dana Scott Influential?
(Suggest an Edit or Addition)According to Wikipedia, Dana Stewart Scott is an American logician who is the emeritus Hillman University Professor of Computer Science, Philosophy, and Mathematical Logic at Carnegie Mellon University; he is now retired and lives in Berkeley, California. His work on automata theory earned him the 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 also worked on modal logic, topology, and category theory.
Dana Scott's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Finite Automata and Their Decision Problems (1959) (1875)
- A Compendium of Continuous Lattices (1980) (1549)
- Continuous Lattices and Domains (2003) (1445)
- Data Types as Lattices (1976) (995)
- Domains for Denotational Semantics (1982) (870)
- Outline of a Mathematical Theory of Computation (1970) (812)
- Foundational aspects of theories of measurement (1958) (613)
- An Introduction to Modal Logic (1977) (584)
- Toward a mathematical semantics for computer languages (1971) (568)
- In handbook of theoretical computer science (1990) (475)
- Measurement structures and linear inequalities (1964) (423)
- Sheaves and logic (1979) (349)
- Advice on Modal Logic (1970) (339)
- Concurrent constraint programming languages (1989) (337)
- Semantic Domains (1991) (333)
- A Type-Theoretical Alternative to ISWIM, CUCH, OWHY (1993) (279)
- Identity and existence in intuitionistic logic (1979) (231)
- The lattice of flow diagrams (1971) (227)
- Lectures on a Mathematical Theory of Computation (1982) (187)
- Assigning Probabilities to Logical Formulas (1966) (153)
- Applications of sheaves (1979) (119)
- Algebras of sets binumerable in complete extensions of arithmetic (1962) (115)
- Lambda Calculus: Some Models, Some Philosophy (1980) (111)
- Some Definitional Suggestions for Automata Theory (1967) (111)
- Completeness and Axiomatizability in Many-Valued Logic (2012) (99)
- Existence and Description in Formal Logic (1973) (97)
- Measurable Cardinals and Constructible Sets (2003) (92)
- Models for Various Type-Free Calculi (1973) (91)
- Continuous Lattices and Domains: The Scott Topology (2003) (88)
- The realizability approach to computable analysis and topology (2000) (87)
- Equilogical spaces (2004) (78)
- LOGIC WITH DENUMERABLY LONG FORMULAS AND FINITE STRINGS OF QUANTIFIERS (2014) (77)
- First Steps Towards Inferential Programming (1983) (75)
- Some Ordered Sets in Computer Science (1982) (67)
- Combinators and classes (1975) (65)
- Extending the Topological Interpretation to Intuitionistic Analysis, II (1970) (63)
- Extensional PERs (1990) (60)
- Rules and Derived Rules (1974) (57)
- Higher Set Theory (1978) (55)
- Type theory via exact categories (1998) (55)
- An introduction to modal logic : the Lemmon notes (1977) (53)
- Logic and programming languages (1977) (51)
- Background to Formalization (1973) (51)
- Axiomatic set theory (1971) (51)
- Equational Completeness of Abstract Algebras (1955) (48)
- A proof of the independence of the continuum hypothesis (1967) (45)
- Extending the topological interpretation to intuitionistic analysis (1968) (43)
- The Sentential Calculus with Infinitely Long Expressions (1958) (41)
- Continuous Lattices and Domains: Preface (2003) (41)
- Review: G. Kreisel, Ordinal Logics and the Characterization of Informal Concepts of Proof (1962) (39)
- A Symmetric Primitive Notion for Euclidean Geometry (1956) (36)
- Local realizability toposes and a modal logic for computability (2002) (35)
- Semantic Domains and Denotational Semantics (1989) (33)
- Some philosophical issues concerning theories of combinators (1975) (31)
- Invariant Borel sets (1964) (23)
- Homotopy Type Theory: Univalent Foundations of Mathematics (2013) (23)
- Additions to some results of Erdös and Tarski (1964) (22)
- Kurt Godel and the Foundations of Mathematics: Horizons Of Truth (2014) (19)
- Quine's Individuals (1966) (18)
- Axiomatic Set Theory, Part 2 (1974) (18)
- Automating Free Logic in Isabelle/HOL (2016) (18)
- Automating Free Logic in HOL, with an Experimental Application in Category Theory (2019) (17)
- Lambda Calculus and Recursion Theory (Preliminary Version) (1975) (14)
- The independence of certain distributive laws in Boolean algebras (1957) (14)
- DECIDABILITY OF SECOND-ORDER THEORIES AND AUTOMATA ON INFINITE TREES (2007) (14)
- Dimension in Elementary Euclidean Geometry1 (1959) (14)
- Stochastic λ-calculi: An extended abstract (2014) (14)
- Editors' note: bibliometrics and the curators of orthodoxy (2009) (13)
- Reconsidering Ordered Pairs (2008) (13)
- Boolean-Valued Semantics for the Stochastic λ-Calculus (2018) (13)
- A Calculus of Regions Respecting Both Measure and Topology (2019) (12)
- Review: Ladislav Rieger, A Contribution to Godel's Axiomatic Set-Theory, I (1958) (11)
- Type Theory via Exact Categories Extended abstract L . Birkedal (1998) (11)
- Notes on the formalization of logic (1981) (11)
- Equationally Complete Extensions of Finite Algebras (1956) (10)
- On the Axiom of Extensionality (1964) (9)
- Axiomatizing Category Theory in Free Logic (2016) (9)
- Topology of Continuous Lattices: The Scott Topology (1980) (8)
- TOWARDS A FORMAL THEORY OF COMPUTABILITY (2010) (8)
- Some Reflections on Strachey and His Work (2000) (7)
- Lambda Calculus Then and Now (2012) (7)
- Capturing Concepts with Data Structures (1986) (6)
- Edge coloring, polyhedra and probability (1998) (6)
- Symbolic Computation and Teaching (1996) (5)
- Semantically based programming tools (1985) (5)
- Semantically Based Programming Tools (Summary) (1985) (5)
- On a theorem of rabin (1960) (5)
- A Note on Distributive Normal Forms (1979) (4)
- Review: A. A. Markov, Insolubility of the Problem of Homeomorphy (1962) (4)
- Computer-Supported Exploration of a Categorical Axiomatization of Modeloids (2019) (4)
- The Computational Model of the Mind (1990) (4)
- Review: Alfred Tarski and the Vienna Circle: Austro-Polish Connections in Logical Empiricism, edited by Jan Woleński and Eckehart Köhler (2004) (3)
- A New Category for Semantics (2001) (3)
- Review: Robert L. Vaught, Applications of the Lowenheim-Skolem-Tarski Theorem to Problems of Completeness and Decidability (1959) (3)
- Continuous Lattices and Domains: Order Theory of Domains (2003) (3)
- Horizons of Truth (2011) (3)
- Axiom Systems for Category Theory in Free Logic (2018) (3)
- A constructive proof of the partial fraction decomposition (1988) (3)
- Continuous Lattices and Domains: A Primer on Ordered Sets and Lattices (2003) (2)
- Spectral Theory of Continuous Lattices (1980) (2)
- Continuous Lattices and Domains: Topological Algebra and Lattice Theory: Applications (2003) (2)
- Effective versions of equilogical spaces (1998) (1)
- Introduction to A Compendium of Continuous Lattices (2003) (1)
- Review: W. Szmielew, Elementary Properties of Abelian Groups (1959) (1)
- G. Gierz, K. H. Hofmann, K. Keimel, J. D. Lawson, M. W. Mislove and D. S. Scott, Continuous Lattices and Domains (2007) (1)
- Some Reflections on a Computer-aided Theory Exploration Study in Category Theory (Extended Abstract) (2018) (1)
- Domains and Logics (Extended Abstract) (1989) (1)
- Morphisms and Functors (1980) (1)
- Logic and foundations of mathematics : dedicated to A. Heyting on his 70th birthday (1968) (1)
- Review: A. Mostowski, On a Generalization of Quantifiers (1958) (1)
- Logical Hygiene, Foundations, and Abstractions: Diversity among Aspects and Options (2011) (1)
- Exploration with Mathematica (1990) (1)
- Powersets, Fixed Points, and Lambda Calculus (2001) (0)
- Review: Petr Hajek, Antonin Sochor, Ein dem Fundierungsaxiom Aquivalentes Axiom (1967) (0)
- Continuous Lattices and Domains: Compact Posets and Semilattices (2003) (0)
- Topology of Continuous Lattices: The Lawson Topology (1980) (0)
- Domains and logics (1989) (0)
- Kreisel G.. Ordinal logics and the characterization of informal concepts of proof. Proceedings of the International Congress of Mathematicians, 14–21 August 1958, Cambridge at the University Press 1960, pp. 289–299. (1962) (0)
- Lattice Theory of Continuous Lattices (1980) (0)
- Automating Free Logic in HOL, with an Experimental Application in Category Theory (2019) (0)
- Review: Elliott Mendelson, Some Proofs of Independence in Axiomatic Set Theory (1958) (0)
- Mendelson Elliott. Some proofs of independence in axiomatic set theory. The journal of symbolic logic, vol. 21 (1956), pp. 291–303.Mendelson Elliott. The independence of a weak axiom of choice. The journal of symbolic logic, pp. 350–366. (1958) (0)
- Review: E. W. Beth, Completeness Results for Formal Systems (1962) (0)
- A Primer on Complete Lattices (1980) (0)
- Compact Posets and Semilattices (1980) (0)
- Markov A. A.. Nérazréšimosť problémy goméomorfii (Insolubility of the problem of homeomorpby). Proceedings of the International Congress of Mathematicians, 14–21 August 1958, Cambridge at the University Press 1960, pp. 300–306. (1962) (0)
- Remarks on Universal Classes of Relational Systems. (1959) (0)
- Review of Subrecursion : Functions and Hierarchies (2003) (0)
- Interpreting Lambda Calculus in Domain-Valued Random Variables (2021) (0)
- Topological Algebra and Lattice Theory: Applications (1980) (0)
- European meeting of the Association for Symbolic Logic (1977) (0)
- Kurt Gödel and the Foundations of Mathematics: Preface (2011) (0)
- Beth E. W.. Completeness results for formal systems. Proceedings of the International Congress of Mathematicians, 14–21 August 1958, Cambridge at the University Press 1960, pp. 281–288. (1962) (0)
- Association for Computing Machinery. 1984 Computer Science Conference (1983) (0)
- Schwarz Gideon. A note on transfinite iteration. The journal of symbolic logic , vol. 21 (1956), pp. 265–266. (1957) (0)
- Vaught Robert L.. Applications of the Löwenheim-Skolem-Tarski theorem to problems of completeness and decidability. Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings , series A, vol. 57 (1954), pp. 467–472; also Indagationes mathematicae, vol. 16 (1954), pp. 467–472. (1959) (0)
- NOTES ON AXIOMS FOR DOMAIN THEORY AND FOR MODELING DENOTATIONAL SEMANTICS (2011) (0)
- Kurt Gödel and the Foundations of Mathematics: Short Biography of Kurt Gödel (2011) (0)
- A Theory of <0 1981 by Car (1981) (0)
- Will Logicians be Replaced by Machines? (1991) (0)
- Notes on the Formalization of Logic Parts 3 and 4 (1981) (0)
- Henkin Leon. On a theorem of Vaught. Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings, series A, vol. 58 (1955), pp. 326–328; also ibid., vol. 17 (1955), pp. 326–328. (1959) (0)
- RULES IN RELEVANT LOGIC- I: (1994) (0)
- Generalization of a lemma of G. F. Rose (1958) (0)
- Continuous Lattices and Domains: Bibliography (2003) (0)
- Review: Leon Henkin, On a Theorem of Vaught (1959) (0)
- Cartesian closed categories of separable Scott domains (2014) (0)
- MSC volume 21 issue 5 Cover and Back matter (2011) (0)
- Computational Logic needs Symbolic Mathematics (1990) (0)
- A selective bibliography of philosophical logic (1978) (0)
- What Can We Hope to Achieve From Automated Deduction? (Abstract) (1996) (0)
- GAUR II: A Program to Analyze Markov Chains (1982) (0)
- A Thesis Proposal on Final Coalgebras (1998) (0)
- Review: Robert L. Vaught, Remarks on Universal Classes of Relational Systems (1959) (0)
- Robert L. Vaught. Remarks on universal classes of relational systems. Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings , series A vol. 57 (1954), pp. 589–591; also ibid., vol. 16 (1954), pp. 589–591. (1959) (0)
- Review: Elliott Mendelson, The Axiom of Fundierung and the Axiom of Choice (1960) (0)
- Stochastic λ-Calculi : ! An Extended (2016) (0)
- A.N. Habermann 1932–1993 (1994) (0)
- Higher set theory : proceedings, Oberwolfach, Germany, April 13-23, 1977 (1978) (0)
- A. Mostowski. On a generalization of quantifiers. Fundamenta mathematicae , vol. 44 (1957), pp. 12–36. (1958) (0)
- theory of complete quasi-metric spaces (2018) (0)
- Lectures on a Mathematical Theory of Computation (Mathematical Studies of Information Processing) (1982) (0)
- Semilattices, Domains, and Computability (Invited Talk) (2009) (0)
- Alternative methods of construction (1987) (0)
- Continuous Lattices and Domains: Foreword to A Compendium of Continuous Lattices (2003) (0)
- THE AXIOM OF DETERMINATENESS AND REDUCTION PRINCIPLES IN THE ANALYTICAL HIERARCHY (0)
- Continuous Lattices and Domains: List of Categories (2003) (0)
- Review: Gideon Schwarz, A Note on Transfinite Iteration (1957) (0)
- Continuous Lattices and Domains: The Lawson Topology (2003) (0)
- New Programs From Old (2007) (0)
- Hájek Petr and Sochor Antonín. Ein dem Fundierungsaxiom äquivalentes Axiom. Fundamenta mathematicae, vol. 10 (1964), pp. 261–263. (1967) (0)
This paper list is powered by the following services:
Other Resources About Dana Scott
What Schools Are Affiliated With Dana Scott?
Dana Scott is affiliated with the following schools:
