Correction
Errata
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. v-vi
-
- Article
- Export citation
Research Article
Early history of the Association for Symbolic Logic
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 255-258
-
- Article
- Export citation
Transfinite recursive progressions of axiomatic theories
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 259-316
-
- Article
- Export citation
An improved prenex normal form1
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 317-326
-
- Article
- Export citation
A propositional logic with subjunctive conditionals
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 327-343
-
- Article
- Export citation
Some forms of completeness
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 344-352
-
- Article
- Export citation
Reviews
Reviews - Paul Bernays. Zur Frage der Unendlichkeitsschemata in der axiomatischen Mengenlehre. Essays on the foundations of mathematics, dedicated to A. A. Fraenkel on his seventieth anniversary, edited by Y. Bar-Hillel, E. I. J. Poznanski, M. O. Rabin, and A. Robinson for The Hebrew University of Jerusalem, Magnes Press, Jerusalem1961, and North-Holland Publishing Company, Amsterdam 1962, pp. 3–49.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 353-354
-
- Article
- Export citation
Gaisi Takeuti. Axioms of infinity of set theory. Journal of the Mathematical Society of Japan, vol. 13 (1961), pp. 220–233.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 354-355
-
- Article
- Export citation
Simon Kochen. Ultraproducts in the theory of models. Annals of mathematics, ser. 2 vol. 74 no. 2 (1961), pp. 221–261.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 355-357
-
- Article
- Export citation
H. Jerome Keisler. Ultraproducts and elementary classes. Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings, series A, vol. 63 (1961), pp. 477–495; also Indagationes mathematicae, vol. 23 (1961), pp. 477–495.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 357-358
-
- Article
- Export citation
A. Grzegorczyk. An example of two weak essentially undecidable theories F and F*. Bulletin de l'Académie Polonaise des Sciences, Série des sciences mathématiques, astronomiques et physiques, vol. 10 (1962), pp. 5–9.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 358
-
- Article
- Export citation
S. C. Kleene. Countable functionals. Constructivity in mathematics, Proceedings of the Colloquium held at Amsterdam, 1957, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam1959, pp. 81–100. - S. C. Kleene. Recursive functionals of higher finite types. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton1960, pp. 148–154.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 359-360
-
- Article
- Export citation
N. M. Nagornyj. Nékotoryé obobščénia ponátiá normaľnogo algorifma, (Some generalizations of the concept of normal algorithm). Problémy konstruktivnogo napravléniá v matématiké, 1, Sbornik rabot, edited by N. A. Šanin. Trudy Matématičéskogo Instituta iméni V. A. Stéklova, vol. 52, Izdatéľstvo Akadémii Nauk SSSR, Moscow and Leningrad1958, pp. 7–65.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 360-362
-
- Article
- Export citation
V. K. Détlovs. Ékvivaleninost′ normal'nyh algorifmov i rékursivnyh funkcij (The equivalence of normal algorithms and recursive functions). Problémy konstruktivnogo napravléniá v matematike, 1, Sbornik rabot, edited by N. A. Šanin. Trudy Maté-matičéskogo Instituta imèni V. A. Stéklova, vol. 52, Izdatéľstvo Akadémii Nauk SSSR, Moscow and Leningrad1958, pp. 75–139.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 362
-
- Article
- Export citation
Ú. I. Ánov. O logičéskih shémah algoritmov (On logical schemata of algorithms). Problémy kibérnétiki, vol. 1 (1958), pp. 75–127.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 362-363
-
- Article
- Export citation
L. A. Kalužnin. Ob algoritmizacii matématičéskih zadač (On algorithmization of mathematical problems). Problémy kibérnétiki, vol. 2 (1959), pp. 51–67.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 363-364
-
- Article
- Export citation
Günter Asser (Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 7 (1961), pp. 20–27) has meanwhile gone farther and shown, inter alia, the equivalence of Kalužnin's graph-schematic algorithm concept with Asser's functional-algorithm concept.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 364
-
- Article
- Export citation
A. P. Éršov. Opératornyé algorifmy. I. (Osnovnyé ponátiá). (Operator algorithms. I. Basic concepts.) Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 3 (1960), pp. 5–48.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 364-366
-
- Article
- Export citation
V. S. Korolúk. O ponátii adrésnogo algoritma (On the concept of address algorithm). Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 4 (1960), pp. 95–110.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 366
-
- Article
- Export citation
N. V. Bélákin. Univérsal′nost′ vyčéslitél′noj mašiny s poténcial′no béskonéčnoj vnéšnéj památ′ú (The universality of a computing machine with potentially infinite exterior memory). Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 5 (1961), pp. 77–86.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 366
-
- Article
- Export citation