Reviews
Eugen Mihăilescu. Forme normale in ansamblul S(C) (Formes normales dans l'ensembles S(C)). Roumanian with Russian and French summaries. Buletin ştiinţific, Secţia de ştiinţe matematice şi fizice, vol. 8 (1956), pp. 329–361. - Eugen Mihăilescu. Generalization of some normal forms.Revue de mathématiques pures et appliquées, vol. 8 no. 1 (1963), pp. 101–115.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 329
-
- Article
- Export citation
W. V. Quine. On cores and prime implicants of truth functions. Selected logic papers, Random House, New York1966, pp. 164–171. (Reprinted from The American mathematical monthly, vol. 66 (1959), pp. 755–760.)
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 329-330
-
- Article
- Export citation
F. I. Andon. Ob odnom podhodé k minimizacii sistém bulévyh funkcij (On one approach to the minimization of systems of Boolean functions). Kibérnétika (Kiev), no. 5 (1966), pp. 44–48. - F. I. Andon. Algoritm uproščéniá d.n.f. bulévyh funckij (A simplification alogrithm of a disjunctive normal form of the Boolean functions). Kibérnétika (Kiev), no. 6 (1966), pp. 12–14.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 330
-
- Article
- Export citation
Paul Lorenzen. Einführung in die operative Logik und Mathematik. Second edition of XXII 289, with minor revisions. Die Grundlehren der mathematischen Wissenschaften, vol. 78. Springer-Verlag, Berlin-Heidelberg-New York1969, VIII + 298 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 330
-
- Article
- Export citation
Saul A. Kripke. Semantical analysis of intuitionistic logic I. Formal systems and recursive functions, Proceedings of the Eighth Logic Colloquium, Oxford, July 1963, edited by J. N. Crossley and M. A. E. Dummett, Series in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam1965, pp. 92–130.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 330-332
-
- Article
- Export citation
Luitzen Egbertus Jan Brouwer. On the significance of the principle of excluded middle in mathematics, especially in function theory, English translation of 15516 by Stefan Bauer-Mengelberg and Jean van Heijenoort. From Frege to Gödel, A source book in mathematical logic, 1879–1931, edited by Jean van Heijenoort, Harvard University Press, Cambridge, Massachusetts, 1967, pp. 334–341. Addenda and corrigenda, English translation of XXIV 189(12) by Stefan Bauer-Mengelberg, Claske M. Berndes Franck, Dirk van Dalen, and Jean van Heijenoort. Ibid., pp. 341–342. Further addenda and corrigenda. English translation of XXIV 189(13) by Stefan Bauer-Mengelberg, Dirk van Dalen, and Jean van Heijenoort. Ibid., pp. 342–345. - Luitzen Egbertus Jan Brouwer. On the domains of definition of functions. From Frege to Gödel, A source book in mathematical logic, 1879–1931, edited by Jean van Heijenoort, Harvard University Press, Cambridge, Massachusetts, 1967, pp. 446–463. English translation of §§1–3 of Über Definitionsbereiche von Funktionen (Mathematische Annalen, vol. 97 (1926–27), pp. 60–75) by Stefan Bauer-Mengelberg. - Luitzen Egbertus Jan Brouwer. Intuitionistic reflections on formalism. English translation of §1 of 15520 by Stefan Bauer-Mengelberg. From Frege to Gödel, A source book in mathematical logic, 1879–1931, edited by Jean van Heijenoort, Harvard University Press, Cambridge, Massachusetts, 1967, pp. 490–492.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 332-333
-
- Article
- Export citation
G. Kreisel. The axiom of choice and the class of hyperarithmetic functions. Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings, series A, vol. 65 (1962), pp. 307–319; also Indagationes mathematicae, vol. 24 (1962), pp. 307–319.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 333-334
-
- Article
- Export citation
G. Kreisel. Analysis of Cantor-Bendixson theorem by means of the analytic hierarchy.Bulletin de l'Académie Polonaise des Sciences, Série des sciences mathématiques, astronomiques et physiques, vol. 7 (1959), pp. 621–626.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 334
-
- Article
- Export citation
R. L. Goodstein and J. Hooley. On recursive transcendence. Notre Dame journal of formal logic, vol. 1 (1960), pp. 127–137.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 335
-
- Article
- Export citation
M. Machover. The theory of transfinite recursion. Bulletin of the American Mathematical Society. vol. 67 (1961). pp. 575–578.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 335
-
- Article
- Export citation
Paul R. Young. A note on pseudo-creative sets and cylinders. Pacific journal of mathematics, vol. 14 (1964), pp. 749–753. - Paul R. Young. On semi-cylinders, splinters, and bounded truth-table reducibility. Transactions of the American Mathematical Society, vol. 115 (1965), pp. 329–339. - Paul R. Young. On pseudo-creative sets, splinters, and bounded-truth-table reducibility. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 13 (1967), pp. 25–31.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 335
-
- Article
- Export citation
John N. Crossley and Kurt Schütte. Non-uniqueness at ω2 in Kleene's O. Archiv für mathematische Logik und Grundlagenforschung, vol. 9 (1966), pp. 95–101. - Peter H. G. Aczel. Paths in Kleene's O. Archiv für mathematische Logik und Grundlagenforschung, vol. 10 (1967), pp. 8–12.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 336
-
- Article
- Export citation
A. I. Mal′cév. Polno numérovannyé množéstva (Complete enumeration of a set). Algébra i logika, Séminar, vol. 2 no. 2 (1963), pp. 4–29. - A. I. Mal′cév. K téorii vyčislimyh séméjstv obéktov (On the theory of computable families of objects). Archiv für mathematische Logik und Grundlagenforschung, vol. 3 no. 4 (1964), pp. 5–31. - A. I. Mal′cév. Pozitwnyé i négatwnyé numéracii (Positive and negative numerations). Doklady Akadémii Nauk, SSSR, vol. 160 (1965), pp. 278–280.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 336-337
-
- Article
- Export citation
B. A. Trahténbrot. Složnost algoritmov i vyčíslenij (Spéckurs dlá studéntov NGU)(Complexity of algorithms and computations (Special course for students of the Novosibirsk Government University)). Novosibirskij Gosudarstvénnyj Univérsitét, Novosibirsk1967, 258 pp., mimeographed.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 337-339
-
- Article
- Export citation
A. V. Gladkij. Nékotoryé algoritmičéskié problémy dlá kontékstno-svobodnyh grammatik (Certain algorithmic problems for context-free grammars). Algébra i logika, Séminar, vol. 4 no. 1 (1965), pp. 3–13. - A. V. Gladkij. Algoritmičéskaá néraspoznavaémost′ suščéstvénnoj néoprédélénnosti kontékstno-svobodnyh ázykov (Algorithmic unsolvability of inherent ambiguity in context-free languages). Algébra i logika, Séminar, vol. 4 no. 4 (1965), pp. 53–63. - O. S. Kulagina. Ob odnom sposobé oprédéléniá grammatičéskih ponátij na bazé téorii množéstv (On a way of defining grammatical notions using set theory). Problémy kibérnétiki, vol. 1 (1958), pp. 203–214. - A. V. Gladku. Konfiguracionnyé haraktéristiki ázykov (Configuration characteristics of languages). Problémy kibérnétiki, vol. 10 (1963), pp. 251–260. - V. D. Lučkin. O rangah konfiguracij kontékstnosvobodnyh ázykov (On the ranks of configurations of context-free languages). Algébra i logika, Séminar, vol. 5 no. 3 (1966), pp. 59–70.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 339-340
-
- Article
- Export citation
A. V. Gladkij. O raspoznavanii zaméščaémosti v rékursivnyh ázykah. Algébra i logika, Séminar, vol. 2 no. 3 (1963), pp. 5–22. - A. V. Gladkii. On the recognition of replaceability in recursive languages. English translation of the above by M. Greendlinger. American Mathematical Society translations, ser. 2 vol. 64 (1967), pp. 81–96.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 340
-
- Article
- Export citation
C. R. J. Clapham. An embedding theorem for finitely generated groups. Proceedings of the London Mathematical Society, ser. 3 vol. 17 (1967), pp. 419–430.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 340-341
-
- Article
- Export citation
Akiko Kino. On definability of ordinals in logic with infinitely long expressions. The journal of symbolic logic, vol. 31 (1966), pp. 365–375. - Akiko Kino. Correction to a paper on definability of ordinals in infinite logic. The journal of symbolic logic, vol. 32 (1967), pp. 343–344.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 341
-
- Article
- Export citation
Kenneth Kunen. Implicit definability and infinitary languages. The journal of symbolic logic, vol. 33 (1968), pp. 446–451.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 341-342
-
- Article
- Export citation
Gebhard Furhken. Languages with added quantifier “there exist at least Nα.”The theory of models, Proceedings of the 1963 International Symposium at Berkeley, edited by J. W. Addison, Leon Henkin, and Alfred Tarski, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam1965, pp. 121–131.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 342
-
- Article
- Export citation