49 found
Order:
  1. (1 other version)Introduction to mathematical logic.Elliott Mendelson - 1964 - Princeton, N.J.,: Van Nostrand.
    The Fourth Edition of this long-established text retains all the key features of the previous editions, covering the basic topics of a solid first course in ...
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   188 citations  
  2. Second Thoughts about Church's Thesis and Mathematical Proofs.Elliott Mendelson - 1990 - Journal of Philosophy 87 (5):225-233.
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  3.  38
    The Incomplete Universe: Totality, Knowledge, and Truth.Elliott Mendelson & Patrick Grim - 1994 - Philosophical Quarterly 44 (176):409.
  4.  28
    On some recent criticism of Church's Thesis.Elliott Mendelson - 1963 - Notre Dame Journal of Formal Logic 4 (3):201-205.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  5.  87
    The independence of a weak axiom of choice.Elliott Mendelson - 1956 - Journal of Symbolic Logic 21 (4):350-366.
  6.  26
    On non-standard models for number theory.Elliott Mendelson - 1961 - In Bar-Hillel, Yehoshua & [From Old Catalog] (eds.), Essays on the Foundations of Mathematics. Jerusalem,: Magnes Press. pp. 259--268.
  7.  39
    (1 other version)Meeting of the association for symbolic logic.P. C. Gilmore, Donald Martin & Elliott Mendelson - 1975 - Journal of Symbolic Logic 40 (2):299-304.
  8.  23
    A. N. Kolmogorov and V. A. Uspeńskij. K oprédéléniú algoritma . Uspéhi matématičéskih nauk, vol. 13 no. 4 , pp. 3–28.Elliott Mendelson - 1973 - Journal of Symbolic Logic 38 (4):655.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  9.  45
    (1 other version)A Semantic Proof of the Eliminability of Descriptions.Elliott Mendelson - 1960 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 6 (7-14):199-200.
    Direct download  
     
    Export citation  
     
    Bookmark  
  10.  27
    B. A. Trahténbrot. O častotnom vyčislénii funkcij . Algébra i logika, Séminar, vol. 2 no. 1 , pp. 25–32.Elliott Mendelson - 1974 - Journal of Symbolic Logic 39 (3):606.
  11.  69
    Critical studies/book reviews.Elliott Mendelson - 2000 - Philosophia Mathematica 8 (3):345-346.
  12.  50
    Graham Oppy. Philosophical perspectives on infinity.Elliott Mendelson - 2007 - Philosophia Mathematica 15 (3):397-399.
    The author tells us that this book was originally intended to be part of a larger work, with the provisional title God and Infinity, but that he opted instead for a separate and independent treatment of the notion of infinity in philosophy and related areas. The original purpose is very well-hidden, showing itself clearly only in the Preface and a few other places. The book begins with a chapter describing some known alleged difficulties having to do with the infinitely large (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  13.  33
    J. W. Swanson. A reduction theorem for normal algorithms. The journal of symbolic logic, vol. 31 , pp. 86–97.Elliott Mendelson - 1967 - Journal of Symbolic Logic 32 (1):123.
  14.  47
    Logic, Methodology, and Philosophy of Science. Three ReviewsLogic, Methodology, and Philosophy of Science.Elliott Mendelson, Richard C. Jeffrey, Ernest Adams, Ernest Nagel, Patrick Suppes & Alfred Tarski - 1964 - Journal of Philosophy 61 (2):76.
  15.  21
    M. D. Gladstone. Finite models for inequalities. The journal of symbolic logic, vol. 31 , pp. 581–592.Elliott Mendelson - 1968 - Journal of Symbolic Logic 33 (3):479.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  16.  22
    (1 other version)Montague R. and Vaught R. L.. A note on theories with selectors. Fundamenta mathematical vol. 47 , pp. 243–247.Elliott Mendelson - 1960 - Journal of Symbolic Logic 25 (2):177-178.
  17.  7
    On the Impossibility of Proving the “Hard-Half” of Church’s Thesis.Elliott Mendelson - 2006 - In Adam Olszewski, Jan Wolenski & Robert Janusz (eds.), Church's Thesis After 70 Years. Ontos Verlag. pp. 304-309.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  18.  38
    (1 other version)Some proofs of independence in axiomatic set theory.Elliott Mendelson - 1956 - Journal of Symbolic Logic 21 (3):291-303.
  19.  7
    Strongly Related Models and Recursively Complete Algebras.Elliott Mendelson - 1966 - Journal of Symbolic Logic 31 (4):649-650.
  20.  6
    Strong Representability of Sets by Calculi.Elliott Mendelson - 1967 - Journal of Symbolic Logic 32 (3):391-392.
    Direct download  
     
    Export citation  
     
    Bookmark  
  21.  6
    The Axiom of Fundierung and the Axiom of Choice.Elliott Mendelson - 1958 - Archive for Mathematical Logic 4 (3-4):65.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  22.  56
    Theory and Problems of Boolean Algebra and Switching Circuits.Elliott Mendelson - 1974 - Journal of Symbolic Logic 39 (3):615-615.
  23.  34
    Annual meeting of the association for symbolic logic.Sidney Morgenbesser & Elliott Mendelson - 1966 - Journal of Symbolic Logic 31 (4):682-696.
  24.  17
    Foundations: Logic, Language, and Mathematics.Hugues Leblanc, Elliott Mendelson & A. Orenstein - 1984 - Dordrecht, Netherland: Springer.
    The more traditional approaches to the history and philosophy of science and technology continue as well, and probably will continue as long as there are skillful practitioners such as Carl Hempel, Ernest Nagel, and th~ir students. Finally, there are still other approaches that address some of the technical problems arising when we try to provide an account of belief and of rational choice. - These include efforts to provide logical frameworks within which we can make sense of these notions. This (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  25.  18
    Quelques Pseudo-Paradoxes de la "Calculabilité Effective.".Jean Porte & Elliott Mendelson - 1968 - Journal of Symbolic Logic 33 (3):471-472.
  26.  5
    Identical Transformations in Four-Place Logic.J. N. Whitney & Elliott Mendelson - 1972 - Journal of Symbolic Logic 37 (4):762-763.
  27.  25
    Naive Set Theory. [REVIEW]Elliott Mendelson - 1960 - Journal of Philosophy 57 (15):512-513.
  28.  16
    Review: A. N. Kolmogorov, V. A. Uspenskij, On the Definition of an Algorithm. [REVIEW]Elliott Mendelson - 1973 - Journal of Symbolic Logic 38 (4):655-655.
  29.  20
    (1 other version)A. I. Mal′cév. Polno numérovannyé množéstva . Algébra i logika, Séminar, vol. 2 no. 2 , pp. 4–29. - A. I. Mal′cév. K téorii vyčislimyh séméjstv obéktov . Archiv für mathematische Logik und Grundlagenforschung, vol. 3 no. 4 , pp. 5–31. - A. I. Mal′cév. Pozitwnyé i négatwnyé numéracii . Doklady Akadémii Nauk, SSSR, vol. 160 , pp. 278–280. [REVIEW]Elliott Mendelson - 1970 - Journal of Symbolic Logic 35 (2):336-337.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  30.  25
    (1 other version)Bernays Paul. Axiomatic set theory. Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam 1958, VIII + 226 pp.Fraenkel A. A.. Part I. Historical introduction. Therein, pp. 3–35. [REVIEW]Elliott Mendelson - 1959 - Journal of Symbolic Logic 24 (3):224-225.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  31.  89
    Book review: Igor Lavrov, Larisa Maksimova, problems in set theory, mathematical logic and the theory of algorithms, edited by Giovanna Corsi, kluwer academic / plenum publishers, 2003, us$141.00, pp. XII + 282, isbn 0-306-47712-2, hardbound. [REVIEW]Elliott Mendelson - 2005 - Studia Logica 79 (3):409-410.
  32.  40
    Halpern J. D.. The independence of the axiom of choice from the Boolean prime ideal theorem. Fundamenta mathematicae, vol. 55 , pp. 57–66. [REVIEW]Elliott Mendelson - 1967 - Journal of Symbolic Logic 32 (2):273-274.
  33.  24
    (1 other version)Lévy Azriel. On models of set theory with urelements. Bulletin de l'Académie Polonaise des Sciences, Série des sciences mathématiques, astronomiques et physiques, vol. 8 , pp. 463–465. [REVIEW]Elliott Mendelson - 1971 - Journal of Symbolic Logic 36 (4):682-682.
  34.  21
    (1 other version)A. Mostowski. On models of axiomatic set-theory. Bulletin de l′Académie Polonaise des Sciences, Classe III, vol. 4 , pp. 663–667. - A. Mostowski. Zaméčaniá k dokazatél′stvam suščéstvovaniá standartnyh modéléj . Trudy Trét′égo Vsésoúznogo Matématičéskogo Sézda, Moskva, iún′-iúl′ 1956, Volume IV, Kratkoé sodéržanié sékcionnyh dokladov, doklady inostrannyh učényh, Izdatél′stvo Akadémii Nauk SSSR, Moscow1959, pp. 232–236. [REVIEW]Elliott Mendelson - 1968 - Journal of Symbolic Logic 32 (4):531-532.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  35.  22
    Many-Valued Logic. [REVIEW]Elliott Mendelson - 1970 - Journal of Philosophy 67 (13):457-458.
  36.  26
    Measurement: Definitions and Theories. [REVIEW]Elliott Mendelson - 1960 - Journal of Philosophy 57 (15):513-514.
  37.  14
    (1 other version)Katuzi Ono. On a practical way of describing formal deductions. Nagoya mathematical journal, vol. 21 (1962), pp. 115–121. - Katuzi Ono. New formulation of the axiom of choice by making use of the comprehension operator. Nagoya mathematical journal, vol. 23 (1963), pp. 53–71. [REVIEW]Elliott Mendelson - 1969 - Journal of Symbolic Logic 34 (2):307-307.
  38.  32
    (1 other version)Polákov É. A.. Algébry rékursivnyh funkcij . Algébra i logika, Séminar, vol. 3 no. 1 , pp. 41–56.Polákov É. A.. O nékotoryh svojstvah algébr rékwsivnyh funkcij . Algébra i logika, Séminar, vol. 3 no. 3 , pp. 39–57. [REVIEW]Elliott Mendelson - 1972 - Journal of Symbolic Logic 37 (2):408-409.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  39.  24
    Philosophical Problems of Many-Valued Logic. [REVIEW]Elliott Mendelson - 1966 - Journal of Philosophy 63 (15):445-446.
  40.  14
    (1 other version)Review: A. I. Mal'cev, Algorithms and Recursive Functions. [REVIEW]Elliott Mendelson - 1969 - Journal of Symbolic Logic 34 (2):290-290.
  41.  9
    Review: B. A. Trahtenbrot, On Frequential Computation of Functions. [REVIEW]Elliott Mendelson - 1974 - Journal of Symbolic Logic 39 (3):606-606.
  42.  16
    (1 other version)Review: Dana Scott, On Constructing Models for Arithmetic. [REVIEW]Elliott Mendelson - 1973 - Journal of Symbolic Logic 38 (2):336-337.
  43.  11
    (1 other version)Review: Hao Wang, Process and Existence in Mathematics. [REVIEW]Elliott Mendelson - 1965 - Journal of Symbolic Logic 30 (2):244-244.
  44. Review: J. W. Swanson, A Reduction Theorem for Normal Algorithms. [REVIEW]Elliott Mendelson - 1967 - Journal of Symbolic Logic 32 (1):123-123.
     
    Export citation  
     
    Bookmark  
  45.  10
    Review: M. D. Gladstone, Finite Models for Inequalities. [REVIEW]Elliott Mendelson - 1968 - Journal of Symbolic Logic 33 (3):479-479.
  46.  20
    Review: R. Montague, R. L. Vaught, Natural Models of Set Theories. [REVIEW]Elliott Mendelson - 1960 - Journal of Symbolic Logic 25 (2):177-177.
  47.  8
    (1 other version)Review: V. A. Uspenskij, (Lekcii o vycislimyh funkciah)Lectures on Computable Functions. [REVIEW]Elliott Mendelson - 1966 - Journal of Symbolic Logic 31 (2):263-264.
  48.  14
    (1 other version)Review: Yu. L. Ershov, E. A. Palyutin, Mathematical Logic. [REVIEW]Elliott Mendelson - 1986 - Journal of Symbolic Logic 51 (3):829-829.
  49.  38
    A. Białynicki-Birula and H. Rasiowa. On constructible falsity in the constructive logic with strong negation. Colloquium mathematicum, vol. 6 (1958), pp. 287–310. [REVIEW]Gene F. Rose, V. A. Jankov, Sue Walker & Elliott Mendelson - 1970 - Journal of Symbolic Logic 35 (1):138-138.