Hostname: page-component-848d4c4894-5nwft Total loading time: 0 Render date: 2024-05-19T13:24:04.302Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Ulrich Berger
Ulrich Berger*
Affiliation:
Department of Computer Science, University of Wales Swansea, Singleton Park, Swansea SA2 8PP, Wales.u.berger@swan.ac.uk.
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 7 , Issue 2 , June 2001 , pp. 280 - 281
Copyright
Copyright © Association for Symbolic Logic 2001

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