Contents
Reviews
Raymond Turner. Truth and modality for knowledge representation. Pitman, London 1990, v + 122 pp., and Artificial intelligence series, The MIT Press, Cambridge, Mass., 1991, vii + 126 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 693-696
-
- Article
- Export citation
Erwin Engeler. The combinatory programme. In collaboration with K. Aberer, B. Amrhein, O. Gloor, M. von Mohrenschildt, D. Otth, G. Schwärzler, and T. Weibel. Progress in theoretical computer science, no. 15. Birkhäuser, Boston, Basel, and Berlin, 1995, vii + 143 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 696-697
-
- Article
- Export citation
Logic and computation, Proceedings of a workshop held at Carnegie Mellon University, June 30–July 2, 1987, edited by Wilfried Sieg, Contemporary Mathematics, vol. 106, American Mathematical Society, Providence1990, xiv + 297 pp. - Douglas K. Brown. Notions of closed subsets of a complete separable metric space in weak subsystems of second order arithmetic. Pp. 39–50. - Kostas Hatzikiriakou and Stephen G. Simpson. WKL0 and orderings of countable abelian groups. Pp. 177–180. - Jeffry L. Hirst. Marriage theorems and reverse mathematics. Pp. 181–196. - Xiaokang Yu. Radon–Nikodym theorem is equivalent to arithmetical comprehension. Pp. 289–297. - Fernando Ferreira. Polynomial time computable arithmetic. Pp. 137–156. - Wilfried Buchholz and Wilfried Sieg. A note on polynomial time computable arithmetic. Pp. 51–55. - Samuel R. Buss. Axiomatizations and conservation results for fragments of bounded arithmetic. Pp. 57–84. - Gaisi Takeuti. Sharply bounded arithmetic and the function a – 1. Pp. 281–288. - Peter G. Clote. A smash-based hierarchy between PTIME and PSPACE (preliminary version). Pp. 85–100. - Solomon Feferman. Polymorphic typed lambda-calculi in a type-free axiomatic framework. Pp. 101–136 - Michael Beeson. Some theories conservative over intuitionistic arithmetic. Pp. 1–15.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 697-699
-
- Article
- Export citation
Erwin Engeler and Peter Läuchli. Berechnungstheorie für Informatiker. With assistance from Ronald Peikert. Leitfäden und Monographien der Informatik. B. G. Teubner, Stuttgart1988, 120 pp. - Arnold Oberschelp. Rekursionstheorie. B. I. Wissenschaftsverlag, Mannheim, Leipzig, Vienna, and Zürich, 1993, 339 pp. - Walter Felscher. Berechenbarkeit. Rekursive und programmierbare Funktionen. Springer-Lehrbuch. Springer-Verlag, Berlin, Heidelberg, New York, etc., 1993, xi + 478 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 699-701
-
- Article
- Export citation
Robert W. Floyd and Richard Beigel. The language of machines. An introduction to computability and formal languages. Computer Science Press, New York1994, xvii + 706 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 701-703
-
- Article
- Export citation
Martin D. Davis, Ron Sigal, and Elaine J. Weyuker. Computability, complexity, and languages. Fundamentals of theoretical computer science. Second edition of LII 293. Computer science and scientific computing. Academic Press, Boston, San Diego, New York, etc., 1994, xix + 609 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 703-704
-
- Article
- Export citation
Front matter
JSL volume 61 issue 2 Cover and Front matter
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. f1-f2
-
- Article
-
- You have access
- Export citation
Back matter
JSL volume 61 issue 2 Cover and Back matter
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. b1-b2
-
- Article
-
- You have access
- Export citation