이전페이지 이동
   Dana S. Scott (Dana S. Scott Professor)
    Carnegie Mellon University
Total: 87
  • Dana Scott's work with generalized consequence relations. (Humberstone, Lloyd) Stud. Univers. Log. (2012), Pages 263-279 

  • Completeness and axiomatizability in many-valued logic Stud. Univers. Log. (2012), Pages 281-305 

  • A note on "Extensional PERs'' (Stekelenburg, W. P.) J. Pure Appl. Algebra (2011), Vol 215Pages 253-256 

  • Kurt Gödel and the foundations of mathematics. Cambridge University Press (2011), Pages xxiv+515 

  • Two questions from Dana Scott: intuitionistic topologies and continuous functions. (McCarty, Charles) J. Symbolic Logic (2009), Vol 74Pages 689-692 

  • Reconsidering ordered pairs. (McCarty, Dominic) Bull. Symbolic Logic (2008), Vol 14Pages 379-397 

  • The algebraic interpretation of quantifiers: intuitionistic and classical. Andrzej Mostowski and foundational studies (2008), Pages 289-312 

  • The seventeen provers of the world. Lecture Notes in Comput. Sci. (2006), Pages xvi+159 

  • Equilogical spaces. (Bauer, Andrej; Birkedal, Lars) Theoret. Comput. Sci. (2004), Vol 315Pages 35-59 

  • Preface (Birkedal, Lars; Escardó, Martiń; Jung, Achim; Rosolini, Giuseppe) Theoret. Comput. Sci. (2004), Vol 316Pages 1-2 

  • Continuous lattices and domains. (Gierz, G.; Hofmann, K. H.; Keimel, K.; Lawson, J. D.; Mislove, M.) Encyclopedia Math. Appl. (2003), Pages xxxvi+591 

  • Realizability. Cambridge University Press (2002), Pages 237–347 

  • Local realizability toposes and a modal logic for computability. (Awodey, Steven; Birkedal, Lars) Math. Structures Comput. Sci. (2002), Vol 12Pages 319-334 

  • Type theory via exact categories (extended abstract). (Birkedal, L.; Carboni, A.; Rosolini, G.) IEEE Computer Soc. (1998), Pages 188-198 

  • A. N. Habermann (1932–1993). Acta Inform. (1994), Vol 31Pages 1-3 

  • A historical note on D. S. (Hintikka, Jaakko) Jbuch. Kurt-Gödel-Ges. (1993), Vol 45

  • A type-theoretical alternative to ISWIM, CUCH, OWHY. Theoret. Comput. Sci. (1993), Vol 121Pages 411–440 

  • Extensional PERs. Selections from the 1990 IEEE Symposium on Logic in Computer Science. (Freyd, P.; Mulry, P.; Rosolini, G.) Inform. and Comput. (1992), Vol 98Pages 211-227 

  • A game-theoretical interpretation of logical formulae. Jbuch. Kurt-Gödel-Ges. (1991), Pages 47-48 

  • Extensional PERs. (Freyd, P.; Mulry, P.; Rosolini, G.) IEEE Comput. Soc. Press (1990), Pages 346–354 

  • Semantic domains. (Gunter, C. A.) computer science (1990), Vol BPages 633-674 

  • Computation of language. (Hausser, Roland) Symbol. Comput. Artificial Intelligence (1989), Pages xvi+425 

  • Boolean-valued models and independence proofs in set theory. Oxford Logic Guides (1985), Pages Logic Guid 

  • Semantically based programming tools (summary). (Scherlis, William L.) Lecture Notes in Comput. Sci. (1985), Pages 52-59 

  • The continuous lattices bibliography. (Hoffmann, Rudolf-E.; Hofmann, Karl H.) Lecture Notes in Pure and Appl. Math. (1985), Pages lattices b 

  • The advantages of inverted operators in Rayleigh-Ritz approximations. SIAM J. Sci. Statist. Comput. (1982), Vol 3Pages 68-75 

  • Selected papers. Springer-Verlag (1982), Pages xxiv+460 

  • Some ordered sets in computer science. NATO Adv. Study Inst. Ser. C: Math. Phys. Sci. (1982), Pages 677-718 

  • Domains for denotational semantics. Lecture Notes in Comput. Sci. (1982), Pages 577–613 

  • Lectures on a mathematical theory of computation. NATO Adv. Study Inst. Ser. C: Math. Phys. Sci. (1982), Pages 145-292 

  • Denotational semantics: the Scott-Strachey approach to programming language theory. MIT Press Ser. Comput. Sci. (1981), Pages xxx+414 

  • Solving sparse symmetric definite quadratic λ-matrix problems. BIT (1981), Vol 21Pages 475-480 

  • Lambda calculus: some models, some philosophy. North-Holland (1980), Pages 223–265 

  • Relating theories of the λ-calculus. Academic Press (1980), Pages 403–450 

  • A compendium of continuous lattices. (Gierz, Gerhard; Hofmann, Karl Heinrich; Keimel, Klaus; Lawson, Jimmie D.; Mislove, Michael W.) Springer-Verlag (1980), Pages xx+371 

  • Applications of sheaves. Lecture Notes in Math. (1979), Pages xiv+779 

  • Identity and existence in intuitionistic logic. Lecture Notes in Math. (1979), Pages 660–696 

  • Proceedings of the Tarski Symposium. Proc. Sympos. Pure Math. (1979), 

  • Sheaves and logic. (Fourman, M. P.) Lecture Notes in Math. (1979), Pages 302–401 

  • Higher set theory. Lecture Notes in Math. (1978), 

  • Logic and programming languages. Comm. ACM (1977), Vol 20Pages 634-641 

  • An introduction to modal logic. American Philosophical Quarterly (1977), 

  • Boolean-valued models and independence proofs in set theory. Clarendon Press (1977), Pages xviii+126 

  • Data types as lattices. Semantics and correctness of programs. SIAM J. Comput. (1976), Vol 5Pages 522-587 

  • Does many-valued logic have any use? Univ. California Press, Berkeley (1976), Pages 64-95 

  • Lamba calculus and recursion theory. Stud. Logic Found. Math. (1975), Vol 82Pages 154–193 

  • Data types as lattices. Lecture Notes in Math. (1975), Vol 499Pages 579-651 

  • Some philosophical issues concerning theories of combinators. Lecture Notes in Comput. Sci. (1975), Vol 37Pages 346-366 

  • Combinators and classes. Lecture Notes in Comput. (1975), Vol 37Pages 1-26 

  • Proceedings of the Tarski Symposium. Proceedings of Symposia in Pure Mathematics (1974), Vol XXV.Pages xxi+498 

  • Completeness and axiomatizability in many-valued logic. Amer. Math. Soc. (1974), Pages 411-435 

  • Axiomatizing set theory. Proc. Sympos. Pure Math. (1974), Vol XIIIPages 207–214 

  • Background to formalization. North-Holland (1973), Vol 68Pages 244–273 

  • Models for various type-free calculi. Proc. Fourth Internat. Congr. (1973), Vol 74Pages 157–187 

  • Continuous lattices. Lecture Notes in Math. (1972), Vol 274Pages 97-136 

  • Lattice theory, data types and semantics. (1972), Pages 65–106 

  • Axiomatic set theory. American Mathematical Society (1971), Pages v+474 

  • The lattice of flow diagrams. Lecture Notes in Mathematics (1971), Vol 188Pages 311–366 

  • Ordinal definability. (Myhill, John) Proc. Sympos. Pure Math. (1971), Pages 271-278 

  • Extending the topological interpretation to intuitionistic analysis. II. 1970 Intuitionism and Proof Theory (1970), Pages 235–255 

  • Advice on modal logic. 1970 Philosophical Problems in Logic. (1970), Pages 143-173 

  • Constructive validity. Springer (1970), Vol 125Pages 237-275 

  • Boolean models and nonstandard analysis. 1969 Applications of Model Theory to Algebra (1969), Pages 87-92 

  • On completing ordered fields. 1969 Applications of Model Theory to Algebra (1969), Pages 274–278 

  • Extending the topological interpretation to intuitionistic analysis. Compositio Math. (1968), Vol 20Pages 194-210 

  • A proof of the independence of the continuum hypothesis. Math. Systems Theory (1967), Vol 1Pages 89-111 

  • Logic with denumerably long formulas and finite strings of quantifiers. North-Holland (1965), Pages 329–341 

  • Invariant Borel sets. Fund. Math. (1964), Vol 56Pages 117–128 

  • Additions to some results of Erdős and Tarski. (Monk, D.) Fund. Math. (1963/1964), Vol 53Pages 335-343 

  • Correction to the paper "Reduced direct products''. (Frayne, T.; Morel, A. C.) Fund. Math. (1963), Vol 53Pages 117 

  • Reduced direct products. (Frayne, T.; Morel, A. C.) Fund. Math. (1962/1963), Vol 51Pages 195-228 

  • Algebras of sets binumerable in complete extensions of arithmetic. American Mathematical Society (1962), Pages 117-121 

  • Quine's individuals. Stanford Univ. Press (1962), Pages 111–115 

  • Measurable cardinals and constructible sets. Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys. (1961), Vol 9Pages 521-524 

  • More on the axiom of extensionality. 1961 Essays on the foundations of mathematics (1961), Pages 115-131 

  • On a theorem of Rabin. Proc. Ser. A 63 = Indag. Math. (1960), Vol 22Pages 481-484 

  • Finite automata and their decision problems. (Rabin, M. O.) IBM J. Res. Develop. (1959), Vol 3Pages 114-125 

  • Dimension in elementary Euclidean geometry. Proceedings of an International Symposium held at the Univ. of Calif. (1959), 

  • On constructing models for arithmetic. Proc. Sympos. Foundations of Math. (1959), Pages 235–255 

  • The sentential calculus with infinitely long expressions. (Tarski, A.) Colloq. Math. (1958), Vol 6Pages 165-170 

  • Generalization of a lemma of G. F. (Gál, I. L.; Rosser, J. B.) Rose. J. Symb. Logic (1958), Vol 23Pages 137-138 

  • Foundational aspects of theories of measurement. (Suppes, Patrick) J. Symb. Logic (1958), Vol 23Pages 113-128 

  • The independence of certain distributive laws in Boolean algebras. Trans. Amer. Math. Soc. (1957), Vol 84Pages 258-261 

  • A symmetric primitive notion for Euclidean geometry. Nederl. Akad. Wetensch. Proc. Ser. A. (1956), Vol 18Pages 456-461 

  • Equationally complete extensions of finite algebras. Nederl. Akad. Wetensch. Proc. Ser. A. (1956), Vol 18Pages 35-38 

  • A vector method for solving linear equations and inverting matrices. (Roth, J. P.) J. Math. and Phys. (1956), Vol 35Pages 312-317 

  • Equational completeness of abstract algebras. (Kalicki, Jan) Nederl. Akad. Wetensch. Proc. Ser. A. (1955), Vol 17Pages 650-659 

 
Information Center for Mathematical Sciences KAIST
34141 대전광역시 유성구 대학로 291 (구성동373-1)
한국과학기술원(KAIST) 수리과학정보센터
전화 042-350-8196
e-mail : mathnet@mathnet.or.kr
Copyright (C) 2018. ICMS All Rights Reserved.