✳flâneur — a map of the web's best reading

Dana Scott - Wikipedia

en.wikipedia.org · 2,636 words · saved by 1 readers

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.[1] 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. He received his B.A. in Mathematics from the University of California, Berkeley, in 1954. He wrote his Ph.D. thesis on Convergent Sequences of Complete Theories under the supervision of Alonzo Church while at Princeton, and defended his thesis in 1958. Solomon Feferman (2005) writes of this period: Scott began his studies in logic at Berkeley in the early 50s while still an undergraduate. His unusual abilities were soon recognize

Dana Scott - Wikipedia Jump to content From Wikipedia, the free encyclopedia American logician (born 1932) This article includes a list of general references but lacks corresponding inline citations . Please help improve this article by introducing more precise citations. ( February 2018 ) ( Learn how and when to remove this message ) [[Princeton University]] ([[Master of Arts|MA]], PhD)"},"doctoral_advisor":{"wt":"[[Alonzo Church]]"},"doctoral_students":{"wt":"{{plainlist|\n* [[Jack Copeland]]\n* [[Michael Fourman]]\n* [[Kenneth Kunen]]\n* [[Angus Macintyre]]\n* [[Peter Mosses]]\n* [[Roy Dyck

Explore this link on the map →

related reading