Hostname: page-component-cd9895bd7-jkksz Total loading time: 0 Render date: 2024-12-27T07:41:49.883Z Has data issue: false hasContentIssue false
  • English
  • Français

Arithmetic, proof theory, and computational complexity, edited by Peter Clote and Krajíček Jan, Oxford logic guides, no. 23, Clarendon Press, Oxford University Press, Oxford and New York1993, xiii + 428 pp.

Review products

Arithmetic, proof theory, and computational complexity, edited by Peter Clote and Krajíček Jan, Oxford logic guides, no. 23, Clarendon Press, Oxford University Press, Oxford and New York1993, xiii + 428 pp.

Published online by Cambridge University Press:  12 March 2014

Fernando Ferreira
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Reviews
Information
The Journal of Symbolic Logic , Volume 60 , Issue 3 , September 1995 , pp. 1014 - 1017
Copyright
Copyright Ά#x00A9; Association for Symbolic Logic 1995

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)