70 found
Order:
Disambiguations
Dana Scott [64]Dana S. Scott [6]
See also
Profile: Dana Scott (Carnegie Mellon University)
  1. On Engendering an Illusion of Understanding.Dana Scott - 1971 - Journal of Philosophy 68 (21):787-807.
  2.  43
    Foundational Aspects of Theories of Measurement.Dana Scott & Patrick Suppes - 1958 - Journal of Symbolic Logic 23 (2):113-128.
  3.  10
    Boolean-Valued Models and Independence Proofs in Set Theory.J. L. Bell & Dana Scott - 1981 - Journal of Symbolic Logic 46 (1):165-165.
  4.  35
    Existence and Description in Formal Logic.Dana Scott - 1967 - In Ralph Schoenman (ed.), Journal of Symbolic Logic. pp. 181--200.
  5.  14
    Logic with Denumerably Long Formulas and Finite Strings of Quantifiers.Dana Scott - 1965 - In J. W. Addison (ed.), Journal of Symbolic Logic. Amsterdam: North-Holland Pub. Co.. pp. 1104--329.
    Direct download  
     
    Export citation  
     
    My bibliography   13 citations  
  6.  1
    Identity and Existence in Intuitionistic Logic.Dana Scott, M. P. Fourman, C. J. Mulvey & D. S. Scott - 1985 - Journal of Symbolic Logic 50 (2):548-549.
  7.  58
    Reconsidering Ordered Pairs.Dana Scott & Dominic McCarty - 2008 - Bulletin of Symbolic Logic 14 (3):379-397.
    The well known Wiener-Kuratowski explicit definition of the ordered pair, which sets ⟨x, y⟩ = {{x}, {x, y}}, works well in many set theories but fails for those with classes which cannot be members of singletons. With the aid of the Axiom of Foundation, we propose a recursive definition of ordered pair which addresses this shortcoming and also naturally generalizes to ordered tuples of greater lenght. There are many advantages to the new definition, for it allows for uniform definitions working (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  8.  17
    An Introduction to Modal Logic.E. J. Lemmon, Dana Scott & Krister Segerberg - 1979 - Journal of Symbolic Logic 44 (4):653-654.
  9.  7
    Assigning Probabilities to Logical Formulas.Dana Scott & Peter Krauss - 1966 - In Jaakko Hintikka & Patrick Suppes (eds.), Aspects of Inductive Logic. Elsevier: Amsterdam. pp. 219 -- 264.
    Direct download  
     
    Export citation  
     
    My bibliography   5 citations  
  10.  18
    A Proof of the Independence of the Continuum Hypothesis.Dana Scott - 1968 - Journal of Symbolic Logic 33 (2):293-293.
  11.  46
    Semantical Archaeology: A Parable.Dana Scott - 1970 - Synthese 21 (3-4):399 - 407.
    A somewhat fictionalized account of several interpretations of implication is presented together with comparisons between classical, modal, tense, and intuitionistic logics.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  12.  13
    Boolean Models and Nonstandard Analysis.Dana Scott - 1969 - In W. A. J. Luxemburg (ed.), Applications of Model Theory to Algebra, Analysis, and Probability. New York: Holt, Rinehart and Winston. pp. 87--92.
    Direct download  
     
    Export citation  
     
    My bibliography   2 citations  
  13.  6
    Equational Completeness of Abstract Algebras.Jan Kalicki & Dana Scott - 1958 - Journal of Symbolic Logic 23 (1):56-56.
    Direct download  
     
    Export citation  
     
    My bibliography   3 citations  
  14. Review: Elliott Mendelson, Some Proofs of Independence in Axiomatic Set Theory. [REVIEW]Dana Scott - 1958 - Journal of Symbolic Logic 23 (1):42-44.
  15.  9
    On Constructing Models for Arithmetic.Dana Scott - 1973 - Journal of Symbolic Logic 38 (2):336-337.
  16. On Completing Ordered Fields.Dana Scott - 1969 - In W. A. J. Luxemburg (ed.), Applications of Model Theory to Algebra, Analysis, and Probability. New York: Holt, Rinehart and Winston. pp. 274--278.
     
    Export citation  
     
    My bibliography   3 citations  
  17.  9
    A Symmetric Primitive Notion for Euclidean Geometry.Dana Scott - 1968 - Journal of Symbolic Logic 33 (2):288-289.
    Direct download  
     
    Export citation  
     
    My bibliography  
  18.  29
    A Study of Categorres of Algebras and Coalgebras.Jesse Hughes, Steve Awodey, Dana Scott, Jeremy Avigad & Lawrence Moss - unknown
    This thesis is intended t0 help develop the theory 0f coalgebras by, Hrst, taking classic theorems in the theory 0f universal algebras amd dualizing them and, second, developing an interna] 10gic for categories 0f coalgebras. We begin with an introduction t0 the categorical approach t0 algebras and the dual 110tion 0f coalgebras. Following this, we discuss (c0)a,lg€bra.s for 2. (c0)monad and develop 2. theory 0f regular subcoalgebras which will be used in the interna] logic. We also prove that categories 0f (...)
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography  
  19.  4
    Dimension in Elementary Euclidean Geometry.Dana Scott - 1969 - Journal of Symbolic Logic 34 (3):514-514.
    Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  20.  12
    Palmer House Hilton Hotel, Chicago, Illinois April 23–24, 2004.Warren Goldfarb, Erich Reck, Jeremy Avigad, Andrew Arana, Geoffrey Hellman, Colin McLarty, Dana Scott & Michael Kremer - 2004 - Bulletin of Symbolic Logic 10 (3).
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  21.  5
    The Sentential Calculus with Infinitely Long Expressions.Dana Scott & Alfred Tarski - 1965 - Journal of Symbolic Logic 30 (1):95-95.
    Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  22.  27
    Local Realizability Toposes and a Modal Logic for Computability.Steve Awodey, Lars Birkedal & Dana Scott - unknown
    This work is a step toward the development of a logic for types and computation that includes not only the usual spaces of mathematics and constructions, but also spaces from logic and domain theory. Using realizability, we investigate a configuration of three toposes that we regard as describing a notion of relative computability. Attention is focussed on a certain local map of toposes, which we first study axiomatically, and then by deriving a modal calculus as its internal logic. The resulting (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  23.  7
    On the Axiom of Extensionality.R. O. Gandy & Dana Scott - 1964 - Journal of Symbolic Logic 29 (3):142-142.
  24.  3
    Applications of the Lowenheim-Skolem-Tarski Theorem to Problems of Completeness and Decidability.Dana Scott & Robert L. Vaught - 1959 - Journal of Symbolic Logic 24 (1):58.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  25.  6
    Review: A. A. Markov, Insolubility of the Problem of Homeomorphy. [REVIEW]Dana Scott - 1962 - Journal of Symbolic Logic 27 (1):99-99.
  26. Review: W. Szmielew, Elementary Properties of Abelian Groups. [REVIEW]Dana Scott - 1959 - Journal of Symbolic Logic 24 (1):59-59.
     
    Export citation  
     
    My bibliography  
  27. Review: Leon Henkin, On a Theorem of Vaught. [REVIEW]Dana Scott - 1959 - Journal of Symbolic Logic 24 (1):58-58.
     
    Export citation  
     
    My bibliography  
  28. Some Definitional Suggestions for Automata Theory.Dana Scott - 1975 - Journal of Symbolic Logic 40 (4):615-616.
    Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  29. The Lattice of Flow Diagrams.Dana Scott - 1975 - Journal of Symbolic Logic 40 (2):247-248.
  30.  1
    The Independence of Certain Distributive Laws in Boolean Algebras.Dana Scott - 1959 - Journal of Symbolic Logic 24 (1):60-61.
    Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  31.  3
    Background to Formalization.Dana S. Scott - 1977 - Journal of Symbolic Logic 42 (2):316-316.
    Direct download  
     
    Export citation  
     
    My bibliography  
  32. Review: Robert L. Vaught, Applications of the Lowenheim-Skolem-Tarski Theorem to Problems of Completeness and Decidability. [REVIEW]Dana Scott - 1959 - Journal of Symbolic Logic 24 (1):58-58.
     
    Export citation  
     
    My bibliography  
  33.  2
    The Notion of Rank in Set-Theory.Dana Scott - 1966 - Journal of Symbolic Logic 31 (4):662-663.
  34.  1
    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. [REVIEW]Dana Scott - 1962 - Journal of Symbolic Logic 27 (1):78.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  35.  1
    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 , Pp. 467–472; Also Indagationes Mathematicae, Vol. 16 , Pp. 467–472. [REVIEW]Dana Scott - 1959 - Journal of Symbolic Logic 24 (1):58.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  36.  3
    Review: Ladislav Rieger, A Contribution to Godel's Axiomatic Set-Theory, I. [REVIEW]Dana Scott - 1958 - Journal of Symbolic Logic 23 (2):216-217.
  37.  3
    Review: G. Kreisel, Ordinal Logics and the Characterization of Informal Concepts of Proof. [REVIEW]Dana Scott - 1962 - Journal of Symbolic Logic 27 (1):78-78.
  38. Review: Petr Hajek, Die Durch Die Schwach Inneren Relationen Gegebenen Modelle der Mengenlehre. [REVIEW]Dana Scott - 1967 - Journal of Symbolic Logic 32 (3):412-412.
    Translate
     
     
    Export citation  
     
    My bibliography  
  39. Review: Gideon Schwarz, A Note on Transfinite Iteration. [REVIEW]Dana Scott - 1957 - Journal of Symbolic Logic 22 (3):303-303.
  40.  1
    Completeness Proofs for the Intuitionistic Sentential Calculus.Dana Scott - 1960 - Journal of Symbolic Logic 25 (4):351-351.
  41.  1
    Final Report on the Automated Classification and Retrieval Project : MedSORT-1.Jaime G. Carbonell, David A. Evans, Dana S. Scott & Richmond H. Thomason - unknown
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  42.  1
    Review: E. W. Beth, Completeness Results for Formal Systems. [REVIEW]Dana Scott - 1962 - Journal of Symbolic Logic 27 (1):110-110.
  43.  1
    Review: A. Mostowski, On a Generalization of Quantifiers. [REVIEW]Dana Scott - 1958 - Journal of Symbolic Logic 23 (2):217-217.
  44.  1
    Review: Petr Hajek, Modelle der Mengenlehre in Denen Mengen Gegebener Gestalt Existieren. [REVIEW]Dana Scott - 1968 - Journal of Symbolic Logic 33 (3):474-475.
  45.  1
    Review: Wilhelm Ackermann, Zur Axiomatik der Mengenlehre. [REVIEW]Dana Scott - 1958 - Journal of Symbolic Logic 23 (2):215-216.
    Translate
      Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  46. Existence and Description in Formal Logic.Alonzo Church, Dana Scott & Ralph Schoenman - 1973 - Journal of Symbolic Logic 38 (1):166.
  47. Of the Association for Symbolic Logic.Warren Goldfarb, Jeremy Avigad, Andrew Arana, Geoffrey Hellman, Dana Scott & Michael Kremer - 2004 - Bulletin of Symbolic Logic 10 (3):438.
     
    Export citation  
     
    My bibliography  
  48. Horizons of Truth.Baaz Mathias, Christos Papadimitriou, Hilary Putnam, Dana Scott & Charles Harper (eds.) - 2011 - Cambridge University Press.
    No categories
    Translate
     
     
    Export citation  
     
    My bibliography  
  49. Ackermann Wilhelm. Zur Axiomatik der Mengenlehre. Mathematische Annalen, vol. 131 , pp. 336–345.Dana Scott - 1958 - Journal of Symbolic Logic 23 (2):215-216.
    Translate
      Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  50. 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. [REVIEW]Dana Scott - 1962 - Journal of Symbolic Logic 27 (1):110.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
1 — 50 / 70