Contents
Reviews
Jiří Bečvář. Real-time and complexity problems in automata theory. English with Czech summary. Kybernetika (Prague), vol. 1 (1965), pp. 475–498.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 346
-
- Article
- Export citation
Eugen Mihăilescu. Les formes normales dans le calcul bivalent des propositions. French with Russian and English summaries. Analele Universitătii C. I. Parhon (Bucharest), seria Acta logica, vol. 2 (1959), pp. 201-227.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 172-173
-
- Article
- Export citation
V. S. Čérnávskij. Ob odnom klassé normal′nyh algorifmov Markova. Logičéskié isslédovaniá, Sborník statéj, Izdatél′stvo Akadémii Nauk SSSR, Moskau1959, S. 263–299. - V. S. Černjavskií. On a class of normal Markov algorithms. Englische Übersetzung des Vorhergehenden, von J. M. Danskin. American Mathematical Society Translations, Folge 2, Bd. 48 (1965), S. 1–35.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 693
-
- Article
- Export citation
G. B. Keene. Abstract sets and finite ordinals. An introduction to the study of set theory. Pergamon Press, New York, Oxford, London, and Paris, 1961, x + 106 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 543
-
- Article
- Export citation
Eugen Mihăilescu. Sur quelques théorèmes de la logique classique. Revue de mathématiques pures et appliquées, vol. 4 no. 2 (1959), pp. 233–248.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 173
-
- Article
- Export citation
Frank B. Cannonito. The Gödel incompleteness theorem and intelligent machines. AFIPS, Proceedings 1962 Spring Joint Computer Conference, San Francisco, Calif., May 1–3, 1962, vol. 21, The National Press, Palo Alto1962, pp. 71–77.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 693
-
- Article
- Export citation
J. McCarthy. Towards a mathematical science of computation. Information processing 1962, Proceedings oflFIP Congress 62, organized by the International Federation for Information Processing, Munich, 27 August-1 September 1962, edited by Cicely M. Popplewell, North-Holland Publishing Company, Amsterdam1963, pp. 21–28. - John McCarthy. Problems in the theory of computation. Information processing 1965, Proceedings of IFIP Congress 65, organized by the International Federation for Information Processing, New York City, May 24–29, 1965, Volume I, edited by Wayne A. Kalenich, Spartan Books, Inc., Washington, D.C., and Macmillan and Co., Ltd., London, 1965, pp. 219–222.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 346-347
-
- Article
- Export citation
Samuel Goldberg. Probability. An introduction. Prentice-Hall, Inc., Englewood Cliffs, N.J., 1960, xiv + 322 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 543-544
-
- Article
- Export citation
Sheila A. Greibach. The unsolvability of the recognition of linear context-free languages. Journal of the Association for Computing Machinery, vol. 13 (1966), pp. 582–587.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 693
-
- Article
- Export citation
C. S. Lorens. Invertible Boolean functions. IEEE transactions on electronic computers, vol. EC–13 (1964), pp. 529–541.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 347-348
-
- Article
- Export citation
Eugen Mihăilescu. Sur quelques théorèmes dans les calculs des propositions bivalentes. Analele Universitătii C. I. Parhon (Bucharest), seria Acta logica, vol. 3 (1960), pp. 105–115.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 173
-
- Article
- Export citation
F. H. George. Automation cybernetics and society. Leonard Hill [Books] Ltd., London1959, 283 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 544
-
- Article
- Export citation
R. A. Bull. An algebraic study of tense logics with linear time. The journal of symbolic logic, vol. 33 (1968), pp. 27–38. - R. A. Bull. Note on a paper in tense logic. The journal of symbolic logic, vol. 34 (1969), pp. 215–218.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 173
-
- Article
- Export citation
Meeting Report
Meetings of the Association for Symbolic Logic, U.S.-Japan Logic Seminar, Tokyo 1969
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 357-359
-
- Article
- Export citation
Reviews
Robert W. Floyd. A note on mathematical induction on phrase structure grammars. Information and control, vol. 4 (1961), pp. 353–358.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 693-694
-
- Article
- Export citation
Norman L. Thomas. Modern logic. An introduction. College outline series, Barnes & Noble, Inc., New York1966, xvii + 236 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 544-545
-
- Article
- Export citation
D. D. Mahulkar. The groundwork of modern logic. East & West Book House, Baroda, India, 1959, vi + 60 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 545
-
- Article
- Export citation
Meeting Report
Chicago 1967 meeting of the Association for Symbolic Logic
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 359-368
-
- Article
- Export citation
Reviews
G. E. M. Anscombe. Before and after. The philosophical review, vol. 73 (1964), pp. 3–24.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 173-175
-
- Article
- Export citation
B. G. Mirkin. Novyj algoritm postroéniá bazisa v ázyké régularnyh vyražénij. Izvéstiá Akadémii Nauk SSSR, Téchničeskaá Kibérnétika, no. 5 (1966), pp. 113–119. - B. G. Mirkin. An algorithm for constructing a base in a language of regular expressions. English translation of the preceding. Engineering cybernetics, no. 5 (Sept.-Oct. 1966), pp. 110–116.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 694
-
- Article
- Export citation