Contents
Reviews
F. William Lawvere. Functorial semantics of algebraic theories. Proceedings of the National Academy of Sciences of the United States of America, vol. 50 (1963), pp. 869–872.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 340-341
-
- Article
- Export citation
F. William Lawvere. The category of categories as a foundation for mathematics. Proceedings of the Conference on Categorical Algebra, La Jolla 1965, edited by S. Eilenberg, D. K. Harrison, S. MacLane, and H. Röhrl, Springer-Verlag New York Inc., New York 1966, pp. 1–20.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 341
-
- Article
- Export citation
Robert L. Davis. The number of structures of finite relations. Proceedings of the American Mathematical Society, vol. 4 (1953), pp. 486–495.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 341
-
- Article
- Export citation
Herman Rubin and Patrick Suppes. A note on two-place predicates and fitting sequences of measure functions. The journal of symbolic logic, vol. 20 (1955), pp. 121–122.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 341
-
- Article
- Export citation
Charles Parsons. On a number theoretic choice schema and its relation to induction. Intuitionism and proof theory, Proceedings of the summer conference at Buffalo N.Y. 1968, edited by A. Kino, J. Myhill, and R. E. Vesley, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam and London 1970, pp. 459–473. - Charles Parsons. Review of the foregoing. Zentralblatt für Mathematik and ihre Grenzgebiete, vol. 202 (1971), pp. 12–13. - Charles Parsons. On n-quantifier induction. The journal of symbolic logic, vol. 37 (1972), pp. 466–482.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 342
-
- Article
- Export citation
Helmut Pfeiffer. Ein Bezeichnungssystem für Ordinalzahlen. Archiv für mathematische Logik und Grundlagenforschung, vol. 13 (1970), pp. 74–90.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 342
-
- Article
- Export citation
Helmut Pfeiffer. Vergleich zweier Bezeichnungssysteme für Ordinalzahlen.Archiv für mathematische Logik und Grundlagenforschung, vol. 15 (1972), pp. 41–56.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 342-343
-
- Article
- Export citation
A. Grzegorczyk. Recursive objects in all finite types. Fundamenta mathematicae, vol. 54 (1964), pp. 73–93. - Haskell B. Curry. Combinatory recursive objects of all finite types. Bulletin of the American Mathematical Society, vol. 70 (1964), pp. 814–817.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 343
-
- Article
- Export citation
Gerald E. Sacks. Recursion in objects of finite type. Actes du Congrès International des Mathématiciens 1970, Gauthier-Villars, Paris 1971, Vol. 1, pp. 251–254.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 343-344
-
- Article
- Export citation
C. E. M. Yates. On the degrees of index sets. Transactions of the American Mathematical Society, vol. 121 (1966), pp. 309–328.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 344
-
- Article
- Export citation
C. E. M. Yates. On the degrees of index sets. II. Transactions of the American Mathematical Society, vol. 135 (1969), pp. 249–266.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 344
-
- Article
- Export citation
Hisao Tanaka. On limits of sequences of hyperarithmetical functionals and predicates. Commentarii mathematici Universitatis Sancti Pauli, vol. 14 no. 2 (1966), pp. 105–121. - Tosiyuki Tugué and Hisao Tanaka. A note on the effective descriptive set theory. Commentarii mathematici Universitatis Sancti Pauli, vol. 15 no. 1 (1966), pp. 19–28.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 344-345
-
- Article
- Export citation
A. H. Lachlan. On some games which are relevant to the theory of recursively enumerable sets. Annals of mathematics, ser. 2 vol. 91 (1970), pp. 291–310.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 345
-
- Article
- Export citation
John Cleave. The primitive recursive analysis of ordinary differential equations and the complexity of their solutions. Journal of computer and system sciences, vol. 3 (1969), pp. 447–455.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 345-346
-
- Article
- Export citation
Webb Miller. Recursive function theory and numerical analysis. Journal of computer and system sciences vol. 4 (1970), pp. 465–472.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 346
-
- Article
- Export citation
Walter J. Savitch. Relationships between nondeterministic and deterministic tape complexities. Journal of computer and system sciences, vol. 4 (1970), pp. 177–192.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 346-347
-
- Article
- Export citation
D. C. Luckham, D. M. R. Park, and M. S. Paterson. On formalised computer programs. Journal of computer and system sciences, vol. 4 (1970), pp. 220–249.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 347
-
- Article
- Export citation
J. Hartmanis and F. D. Lewis. The use of lists in the study of undecidable problems in automata theory. Journal of computer and system sciences, vol. 5 (1971), pp. 54–66.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 347
-
- Article
- Export citation
Erwin Engeler. Algorithmic approximations. Journal of computer and system sciences, vol. 5 (1971), pp. 67–82.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 348
-
- Article
- Export citation
Zohar Manna. Mathematical theory of partial correctness. Journal of computer and system sciences, vol. 5 (1971), pp. 239–253.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 348
-
- Article
- Export citation