Contents
Reviews
Per Lindström. On characterizability in Lω1ω0. Theoria (Lund), vol. 32 (1966), pp. 165–171.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 587
-
- Article
- Export citation
R. Sikorski. On Herbrand's theorem. Colloquium mathematicum, vol. 6 (1958), pp. 55–58.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 587
-
- Article
- Export citation
M. I. Kargapolov, Ú. I. Mérzlákov, and V. N. Réméslénnikov. Kourovskaá tétrad’ (néréšénnyé zadači téorii grupp) (Kourovsk exercise book (unsolved problems of group theory)). Third edition, supplemented. Akadémiá Nauk SSSR, Sibirskoé Otdélénié, Institut Matématiki, Novosibirsk1969, 63 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 587
-
- Article
- Export citation
J. R. Moschovakis. Disjunction and existence in formalized intuitionistic analysis. Sets, models and recursion theory, Proceedings of the Summer School in Mathematical Logic and Tenth Logic Colloquium, Leicester, August-September 1965, edited by John N. Crossley, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam, and Humanities Press, New York, 1967, pp. 309–331.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 587-588
-
- Article
- Export citation
S. C. Kleene. Turing-machine computable functionals of finite types I. Logic, methodology and philosophy of science, Proceedings of the 1960 International Congress, edited by Ernest Nagel, Patrick Suppes, and Alfred Tarski, Stanford University Press, Stanford, California, 1962, pp. 38–45. - S. C. Kleene. Turing-machine computable functionals of finite types II. Proceedings of the London Mathematical Society, ser. 3 vol. 12 (1962), pp. 245–258.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 588-589
-
- Article
- Export citation
C. E. M. Yates. Recursively enumerable degrees and the degrees less than 0(1). Sets, models and recursion theory, Proceedings of the Summer School in Mathematical Logic and Tenth Logic Colloquium, Leicester, August-September 1965, edited by John N. Crossley, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam, and Humanities Press, New York, 1967, pp. 264–271.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 589
-
- Article
- Export citation
A. Nerode. Additive relations among recursive equivalence types. Mathematische Annalen, vol. 159 (1965), pp. 329–343.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 589-590
-
- Article
- Export citation
Don C. Ferguson. Infinite products of recursive equivalence types. The Journal of symbolic logic, vol. 33 (1968), pp. 221–230.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 590
-
- Article
- Export citation
M. Adrian Carpentier. Creative sequences and double sequences. Notre Dame journal of formal logic, vol. 9 no. 1 (1968), pp. 35–61.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 590
-
- Article
- Export citation
M. D. Davis. A note on universal Turing machines. Automata studies, edited by C. E. Shannon and J. McCarthy, Annals of Mathematics studies no. 34, lithoprinted, Princeton University Press, Princeton1956, pp. 167–175. - Martin Davis. The definition of universal Turing machine. Proceedings of the American Mathematical Society, vol. 8 (1957), pp. 1125–1126.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 590
-
- Article
- Export citation
M. D. Gladstone. A reduction of the recursion scheme. The journal of symbolic logic, Bd. 32 (für 1967, veröff. 1968), S. 505–508.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 591
-
- Article
- Export citation
Paul J. Cohen. Set theory and the continuum hypothesis. W. A. Benjamin, Inc., New York and Amsterdam1966, vi + 154 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 591-592
-
- Article
- Export citation
Rolf Schock. A simple version of the generalized continuum hypothesis. Notre Dame journal of formal logic, vol. 7 no. 3 (1966), pp. 287–288.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 592
-
- Article
- Export citation
George F. Simmons. Introduction to topology and modern analysis. McGraw-Hill Book Company, Inc., New York, San Francisco, Toronto, and London, 1963, xv + 372 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 592
-
- Article
- Export citation
Giulio Andreoli. Funzioni simmetriche, involuzioni ed n-adi in un'algebra di Boole. Giornale di matematiche di Battaglini (Naples), vol. 81 no. 2 (1953), pp. 181–198.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 592
-
- Article
- Export citation
R. V. Fréjvald. Funkcional′naá polnota dlá né vsúdu oprédélénnyh funkcij algébry logiki (Functional completeness for incompletely specified logic functions). Diskrétnyj analiz (Novosibirsk), no. 8 (1966), pp. 55–68.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 592-593
-
- Article
- Export citation
V. V. Vojtišék. Ob odnom podhodé к klassifikacii bulévyh funkcij (On an approach to the classification of Boolean functions). Diskrétnyj analiz (Novosibirsk), no. 8 (1966), pp. 35–41.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 593
-
- Article
- Export citation
O. B. Lupanov. Ob odnom métodé sintéza shém (On a method of circuit synthesis). Izvéstiá vysših učébnyh zavédénij, Radiofizika, no. 1 (1958), pp. 120–140.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 593-594
-
- Article
- Export citation
Erwin Engeler. Formal languages: Automata and structures. Markham Publishing Company, Chicago1968, vii + 81 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 594-595
-
- Article
- Export citation
James R. Slagle. Automatic theorem proving with renamable and semantic resolution. Journal of the Association for Computing Machinery, vol. 14 (1967), pp. 687–697.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 595-596
-
- Article
- Export citation