-
29Halpern 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.
-
42A Semantic Proof of the Eliminability of DescriptionsZeitschrift fur mathematische Logik und Grundlagen der Mathematik 6 (7-14): 199-200. 1960.
-
14Review: R. Montague, R. L. Vaught, Natural Models of Set Theories (review)Journal of Symbolic Logic 25 (2): 177-177. 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.
-
13Reviews - 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.
-
15Montague 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.
-
25Scott Dana. On constructing models for arithmetic. Infinitistic methods, Proceedings of the Symposium on Foundations of Mathematics, Warsaw, 2–9 September 1959, Państwowe Wydawnictwo Naukowe, Warsaw, and Pergamon Press, Oxford, London, New York, and Paris, 1961, pp. 235–255 (review)Journal of Symbolic Logic 38 (2): 336-337. 1973.
-
7Review: M. D. Gladstone, Finite Models for Inequalities (review)Journal of Symbolic Logic 33 (3): 479-479. 1968.
-
11Review: A. N. Kolmogorov, V. A. Uspenskij, On the Definition of an Algorithm (review)Journal of Symbolic Logic 38 (4): 655-655. 1973.
-
19A. 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.
-
28Polá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)Journal of Symbolic Logic 37 (2): 408-409. 1972.
-
20Lé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)Journal of Symbolic Logic 36 (4): 682-682. 1971.
-
3A Semantic Proof Of The Eliminability Of DescriptionsMathematical Logic Quarterly 6 (7-14): 199-200. 1960.
-
5Review: R. Montague, R. L. Vaught, A Note on Theories with Selectors (review)Journal of Symbolic Logic 25 (2): 177-178. 1960.
-
25On some recent criticism of Church's ThesisNotre Dame Journal of Formal Logic 4 (3): 201-205. 1963.
-
9Review: Hao Wang, Process and Existence in Mathematics (review)Journal of Symbolic Logic 30 (2): 244-244. 1965.
-
23Review: Azriel Levy, On Models of Set Theory with Urelements (review)Journal of Symbolic Logic 36 (4): 682-682. 1971.
-
14Wang Hao. Process and existence in mathematics. Essays on the foundations of mathematics, dedicated to A. A. Fraenkel on his seventieth anniversary, edited by Bar-Hillel Y., Poznanski E. I. J., Rabin M. O., and Robinson A. for The Hebrew University of Jerusalem, Magnes Press, Jerusalem 1961, and North-Holland Publishing Company, Amsterdam 1962, pp. 328–351 (review)Journal of Symbolic Logic 30 (2): 244-244. 1965.
-
27Some proofs of independence in axiomatic set theoryJournal of Symbolic Logic 21 (3): 291-303. 1956.
-
20Meeting of the Association for Symbolic Logic, New York, 1974Journal of Symbolic Logic 40 (2): 299-304. 1975.
-
Roman Murawski, recursive functions and metamathematics: Problems of completeness and decidabilityPhilosophia Mathematica 8 (3): 345-346. 2000.
-
2Review: B. A. Trahtenbrot, On Frequential Computation of Functions (review)Journal of Symbolic Logic 39 (3): 606-606. 1974.