Reviews
Thomas Moro Simpson. Formas lógicas, realidad y significado. With a preface by Gregorio Klimovsky. Editorial Universitaria de Buenos Aires, Buenos Aires1964, 302 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 112-113
-
- Article
- Export citation
Mikel Dufrenne. Language & philosophy. Translated from the French by Henry B. Veatch. Indiana University Press, Bloomington1963, 106 pp. - Paul Henle. Foreword. Therein, pp. 11–13.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 113-114
-
- Article
- Export citation
David G. Cantor. On the ambiguity problem of Backus systems. Journal of the Association for Computing Machinery, vol. 9 (1962), pp. 477–479.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 114
-
- Article
- Export citation
Sheila A. Greibach. The undecidability of the ambiguity problem for minimal linear grammars. Information and control, vol. 6 (1963), pp. 119–125.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 114-115
-
- Article
- Export citation
Peter S. Landweber. Decision problems of phrase-structure grammars. IEEE transactions on electronic computers, vol. EC-13 (1964), pp. 354–362.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 115
-
- Article
- Export citation
Henry Hiż. Congrammaticality, batteries of transformations and grammatical categories. Structure of language and its mathematical aspects, Proceedings of symposia in applied mathematics, vol. 12, American Mathematical Society, Providence 1961, pp. 43–50. - H. Hiż. The intuitions of grammatical categories. Methodos, vol. 12 (for 1960, pub. 1961), pp. 311–319.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 115-116
-
- Article
- Export citation
Peter S. Landweber. Three theorems on phrase structure grammars of type 1. Information and control, vol. 6 (1963), pp. 131–136.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 116
-
- Article
- Export citation
S.-Y. Kuroda. Classes of languages and linear-bounded automata. Information and control, vol. 7 (1964), pp. 207–223.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 116-117
-
- Article
- Export citation
Lawrence Wos, Daniel Carson, and George Robinson. The unit preference strategy in theorem proving. AFIPS conference proceedings, Volume 26, 1964 Fall Joint Computer Conference, Spartan Books, Inc., Baltimore, Md., and Cleaver-Hume Press, London, 1964, pp. 615–621.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 117
-
- Article
- Export citation
Lawrence Wos, George A. Robinson, and Daniel F. Carson. Efficiency and completeness of the set of support strategy in theorem proving. Journal of the Association for Computing Machinery, vol. 12 (1965), pp. 536–541.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 117-118
-
- Article
- Export citation
Martin Davis, George Logemann, and Donald Loveland. A machine program for theorem-proving. Communications of the ACM, vol. 5 (1962), pp. 394–397.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 118
-
- Article
- Export citation
Martin Davis. Eliminating the irrelevant from mechanical proofs. Experimental arithmetic, high speed computing and mathematics, Proceedings of symposia in applied mathematics, vol. 15, American Mathematical Society, Providence 1963, pp. 15–30.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 118-119
-
- Article
- Export citation
Stig Kanger. A simplified proof method for elementary logic. Computer programming and formal systems, edited by P. Braffort and D. Hirschberg, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam1963, pp. 87–94.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 119
-
- Article
- Export citation
Hao Wang. Proving theorems by pattern recognition I.Communications of the Association for Computing Machinery, vol. 3 (1960), pp. 220–234. - Hao Wang. Proving theorems by pattern recognition—II.The Bell system technical journal, vol. 40 (1961), pp. 1–41.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 119-120
-
- Article
- Export citation
Hao Wang. Mechanical mathematics and inferential analysis. Computer programming and formal systems, edited by P. Braffort and D. Hirschberg, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam1963, pp. 1–20.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 120
-
- Article
- Export citation
Hao Wang. The mechanization of mathematical arguments. Experimental arithmetic, high speed computing and mathematics, Proceedings of symposia in applied mathematics, vol. 15, American Mathematical Society, Providence 1963, pp. 31–40.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 120
-
- Article
- Export citation
J. Hartmanis and R. E. Stearns. On the computational complexity of algorithms. Transactions of the American Mathematical Society, vol. 117 (1965), pp. 285–306.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 120-121
-
- Article
- Export citation
J. Hartmanis and R. E. Stearns. Computational complexity of recursive sequences. Switching circuit theory and logical design, Proceedings of the Fifth Annual Symposium, Princeton University, Princeton, N.J., November 11–13, 1964, The Institute of Electrical and Electronics Engineers, Inc., New York1964, pp. 82–90.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 121-122
-
- Article
- Export citation
J. C. Shepherdson und H. E. Sturgis. Computability of recursive functions. Journal of the Association for Computing Machinery, Bd. 10 (1963), S. 217–255.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 122-123
-
- Article
- Export citation
J. W. Swanson. A reduction theorem for normal algorithms. The journal of symbolic logic, vol. 31 (1966), pp. 86–97.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 123
-
- Article
- Export citation