Hostname: page-component-586b7cd67f-dlnhk Total loading time: 0 Render date: 2024-11-27T14:38:36.804Z Has data issue: false hasContentIssue false
  • English
  • Français

Arnold Beckmann. Proving consistency of equational theories in bounded arithmetic. The Journal of Symbolic Logic, vol. 67 (2002), pp. 279–296.

Published online by Cambridge University Press:  15 January 2014

Chris Pollett
Chris Pollett*
Affiliation:
Department of Computer Science, San Jose State University, One Washington Square, San Jose, CA [email protected].
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
Bulletin of Symbolic Logic , Volume 9 , Issue 1 , March 2003 , pp. 44 - 45
Copyright
Copyright © Association for Symbolic Logic 2003

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.)