Contents
Reviews
In the light of logic, by Solomon Feferman, Logic and computation in philosophy, Oxford University Press, New York, Oxford, etc., 1998, xii + 340 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 270-277
-
- Article
- Export citation
Neil Immerman. Descriptive complexity. Graduate texts in computer science. Springer, New York, Berlin, and Heidelberg, 1999, xvi + 268 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 525-527
-
- Article
- Export citation
Handbook of recursive mathematics, Volume 1, Recursive model theory, edited by Yu. L. Ershov, S. S. Goncharov, A. Nerode, and J. B. Remmel, with V. W. Marek, Studies in logic and the foundations of mathematics, vol. 138, Elsevier, Amsterdam etc. 1998, xlvi + 620 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 66-69
-
- Article
- Export citation
Review
Joseph R. Shoenfield. Mathematical logic. Republication of JSL XL 234. Association for Symbolic Logic, Urbana, and A K Peters, Natick, Mass., 2001, viii + 344 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, p. 376
-
- Article
- Export citation
Reviews
José Ferreirós. Labyrinth of thought. A history of set theory and its role in modern mathematics. Science networks, vol. 23. Birkhäuser Verlag, Basel, Boston, and Berlin, 1999, xxi + 440 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 277-278
-
- Article
- Export citation
Review
Jon Barwise and John Etchemendy. Language, proof and logic. In collaboration with Gerard Allwein, Dave Barker-Plummer, and Albert Liu. CSLI Publications, Stanford, and Seven Bridges Press, New York and London, 1999, xii + 587 pp. - Gerard Allwein, Dave Barker-Plummer, Jon Barwise, John Etchemendy, and Albert Liu. LPL software manual. CSLI Publications, Stanford, and Seven Bridges Press, New York and London, 1999, vii + 52 pp. + CD-ROM.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 377-379
-
- Article
- Export citation
Reviews
Greg Restall. An introduction to substructural logics. Routledge, London and New York 2000, xiv + 381 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 527-530
-
- Article
- Export citation
Handbook of recursive mathematics, Volume 2, Recursive algebra, analysis and combinatorics, edited by Yu. L. Ershov, S. S. Goncharov, A. Nerode, and J. B. Remmel, with V. W. Marek, Studies in logic and the foundations of mathematics, vol. 139, Elsevier, Amsterdam etc. 1998, xlvi + pp. 621–1372
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 69-71
-
- Article
- Export citation
Marcus Kracht. Tools and techniques in modal logic. Studies in logic and the foundations of mathematics, vol. 142. Elsevier, Amsterdam etc. 1999, xiii + 559 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 278-279
-
- Article
- Export citation
P. G. Odifreddi. Classical recursion theory. Volume II. Studies in logic and the foundations of mathematics, vol. 143. Elsevier, Amsterdam etc. 1999, xvi + 949 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 71-73
-
- Article
- Export citation
G. Aldo Antonelli. Proto-semantics for positive free logic. Journal of philosophical logic, vol. 29 (2000), pp. 277–294.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 531-532
-
- Article
- Export citation
Review
John Etchemendy. The concept of logical consequence. An unaltered republication of JSL LVII 254. The David Hume series of philosophy and cognitive science reissues. Center for the Study of Language and Information, Stanford 1999, also distributed by Cambridge University Press, New York, vii + 174 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 379-380
-
- Article
- Export citation
Reviews
A. S. Troelstra and H. Schwichtenberg. Basic proof theory. Second edition of JSL LXIII 1605. Cambridge tracts in theoretical computer science, no. 43. Cambridge University Press, Cambridge, New York, etc., 2000, xii + 417 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, p. 280
-
- Article
- Export citation
Kai F. Wehmeier. Fragments of HA based on Σ1 -induction. Archive for mathematical logic, vol. 37 no. 1 (1997), pp. 37–49.
-
- Published online by Cambridge University Press:
- 15 January 2014, p. 532
-
- Article
- Export citation
Richard A. Shore and Theodore A. Slaman. Defining the Turing jump. Mathematical research letters, vol. 6 (1999), pp. 711–722.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 73-75
-
- Article
- Export citation
Review
Harold Simmons. Derivation and computation. Taking the Curry-Howard correspondence seriously. Cambridge tracts in theoretical computer science, vol. 51. Cambridge University Press, Cambridge, New York, etc., 2000, xxv + 384 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 380-383
-
- Article
- Export citation
Reviews
Ulrich Kohlenbach. Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals. Archive for mathematical logic, vol. 36 (1996), pp. 31–71.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 280-281
-
- Article
- Export citation
Review
C. J. Ash and J. Knight. Computable structures and the hyperarithmetical hierarchy. Studies in logic and the foundations of mathematics, vol. 144. Elsevier, Amsterdam etc. 2000, xv + 346 pp.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 383-385
-
- Article
- Export citation
Reviews
Ulrich Kohlenbach. On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness. Annals of pure and applied logic, vol. 95 (1998), pp. 257–285.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 75-77
-
- Article
- Export citation
Wolfgang Burr and Volker Hartung. A characterization of the Σ1-definable functions of KPω + (uniform AC). Archive for mathematical logic, vol. 37 no. 3 (1998), pp. 199–214. - Wolfgang Burr. A Diller—Nahm-style functional interpretation of KPω. Archive for mathematical logic, vol. 39 no. 8 (2000), pp. 599–604.
-
- Published online by Cambridge University Press:
- 15 January 2014, pp. 532-533
-
- Article
- Export citation