-
6Review: V. A. Uspenskij, (Lekcii o vycislimyh funkciah)Lectures on Computable Functions (review)Journal of Symbolic Logic 31 (2): 263-264. 1966.
-
Review: J. W. Swanson, A Reduction Theorem for Normal Algorithms (review)Journal of Symbolic Logic 32 (1): 123-123. 1967.
-
26Anita Burdman Feferman and Solomon Feferman. Alfred Tarski: Life and Logic. Cambridge: Cambridge University Press, 2004. Pp. vi + 435. ISBN 0-521-80240-7 (review)Philosophia Mathematica 13 (2): 231-232. 2005.
-
4Review: A.I. Mal'cev, Polno numerovannye mnozestva (Complete Enumeration of a Set); A. I. Mal'cev, K teorii vycislimyh semejstv obektov (On the Theory of Computable Families of Objects); A. I. Mal'cev, Pozitivnye i negativnye numeracii (Positive and Negative Numerations) (review)Journal of Symbolic Logic 35 (2): 336-337. 1970.
-
7Katuzi 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)Journal of Symbolic Logic 34 (2): 307-307. 1969.
-
24Annual meeting of the association for symbolic logicJournal of Symbolic Logic 31 (4): 682-696. 1966.
-
36Graham Oppy. Philosophical perspectives on infinityPhilosophia Mathematica 15 (3): 397-399. 2007.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 and infinitely smal…Read more
-
2Strongly Related Models and Recursively Complete AlgebrasJournal of Symbolic Logic 31 (4): 649-650. 1966.
-
Review: Paul Bernays, Axiomatic Set Theory (review)Journal of Symbolic Logic 24 (3): 224-225. 1959.
-
13A. 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)Journal of Symbolic Logic 35 (1): 138-138. 1970.
-
8Review: Dana Scott, On Constructing Models for Arithmetic (review)Journal of Symbolic Logic 38 (2): 336-337. 1973.
-
10Review: A. I. Mal'cev, Algorithms and Recursive Functions (review)Journal of Symbolic Logic 34 (2): 290-290. 1969.
-
62
-
13Review: Yu. L. Ershov, E. A. Palyutin, Mathematical Logic (review)Journal of Symbolic Logic 51 (3): 829-829. 1986.
-
18Review: Katuzi Ono, On a Practical Way of Describing Formal Deductions; Katuzi Ono, New Formulation of the Axiom of Choice by Making use of the Comprehension Operator (review)Journal of Symbolic Logic 34 (2): 307-307. 1969.
-
59Selmer Bringsjord and Michael Zenzen. Superminds: People Harness Hypercomputation, and More. Studies in Cognitive Systems, Volume 29. Dordrecht: Kluwer Academic Publishers, 2003. Pp. xxx + 339. ISBN 1-4020-1094-X (review)Philosophia Mathematica 13 (2): 228-230. 2005.
-
Review: A. Mostowski, On Models of Axiomatic Set-Theory (review)Journal of Symbolic Logic 32 (4): 531-532. 1967.
-
21On non-standard models for number theoryIn Bar-Hillel, Yehoshua & [From Old Catalog] (eds.), Essays on the Foundations of Mathematics, Magnes Press. pp. 259--268. 1961.
-
13Quelques Pseudo-Paradoxes de la "Calculabilité Effective."Journal of Symbolic Logic 33 (3): 471-472. 1968.
-
31Halpern J. D.. The independence of the axiom of choice from the Boolean prime ideal theorem. Fundamenta mathematicae, vol. 55 , pp. 57–66 (review)Journal of Symbolic Logic 32 (2): 273-274. 1967.
-
13Review: R. Montague, R. L. Vaught, Natural Models of Set Theories (review)Journal of Symbolic Logic 25 (2): 177-177. 1960.
-
41A Semantic Proof of the Eliminability of DescriptionsZeitschrift fur mathematische Logik und Grundlagen der Mathematik 6 (7-14): 199-200. 1960.
-
7Review: E. A. Polakov, Algebras of recursive functions); E. A. Polakov, On some properties of algebras of recursive functions (review)Journal of Symbolic Logic 37 (2): 408-409. 1972.
-
14Reviews - A. I. Mal′Cév. Algoritmy i rekursivnyé funkcii (Algorithms and recursive functions). Izdatél′stvo “Nauka,” Glavnaá Rédakciá Fiziko-Matématičéskoj Litératury, Moscow1965, 391 pp (review)Journal of Symbolic Logic 34 (2): 290-290. 1969.
-
17Montague R. and Vaught R. L.. A note on theories with selectors. Fundamenta mathematical vol. 47 , pp. 243–247Journal of Symbolic Logic 25 (2): 177-178. 1960.
-
11Uspénskij V. A.. Lékcii o vyčislimyh funkciáh . Gosudarstvénnoé Izdatél′stvo Fiziko-matématičéskoj Literatury, Moscow 1960, 492 pp (review)Journal of Symbolic Logic 31 (2): 263-264. 1966.