Research Article
Intuitionistic completeness for first order classical logic
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 304-312
-
- Article
- Export citation
Uniform inseparability in explicit mathematics
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 313-326
-
- Article
- Export citation
The model-theoretic ordinal analysis of theories of predicative strength
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 327-349
-
- Article
- Export citation
The independence of
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 350-362
-
- Article
- Export citation
Logics which capture complexity classes over the reals
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 363-390
-
- Article
- Export citation
Reviews
John P. Burgess and Gideon Rosen, A subject with no object. Strategies for nominalistic interpretation of mathematics, Clarendon Press, Oxford University Press, Oxford and New York1997, xi + 259 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 391-394
-
- Article
- Export citation
Penelope Maddy. Naturalism in mathematics. Clarendon Press, Oxford University Press, Oxford and New York1998 (© 1997), ix + 254 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 394-396
-
- Article
- Export citation
The Columbia history of western philosophy, edited by Richard H. Popkin, Columbia University Press, New York1999, xxvi + 836 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 396
-
- Article
- Export citation
Geoffrey Hellman. Constructive mathematics and quantum mechanics: unbounded operators and the spectral theorem. Journal of philosophical logic, vol. 22 (1993), pp. 221–248.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 397-398
-
- Article
- Export citation
Wilfried Sieg. Step by recursive step: Church's analysis of effective calculability. The bulletin of symbolic logic, vol. 3 (1997), pp. 154–180.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 398-399
-
- Article
- Export citation
Complexity, logic, and recursion theory, edited by Andrea Sorbi, Lecture notes in pure and applied mathematics, vol. 187, Marcel Dekker, Inc., New York, Basel, and Hong Kong, 1997, viii + 363 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 399-401
-
- Article
- Export citation
Raymond M. Smullyan and Melvin Fitting. Set theory and the continuum problem. Oxford logic guides, no. 34. Clarendon Press, Oxford University Press, Oxford, New York, etc., 1996, xiii + 288 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 401-403
-
- Article
- Export citation
Michael Sipser. Introduction to the theory of computation. PWS Publishing Company, Boston etc. 1997, xv + 396 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 403
-
- Article
- Export citation
Anil Nerode and Richard A. Shore. Logic for applications. Texts and monographs in computer science. Springer-Verlag, New York, Berlin, Heidelberg, etc., 1993, xvii + 365 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 404-405
-
- Article
- Export citation
Erratum
Erratum
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 406
-
- Article
-
- You have access
- Export citation
Front matter
JSL volume 64 issue 1 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 64 issue 1 Cover and Back matter
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. b1-b2
-
- Article
-
- You have access
- Export citation