Book contents
- Frontmatter
- Contents
- PREFACE
- PRELIMINARIES
- Part 1 Basic proof theory and computability
- Part 2 Provable recursion in classical systems
- CHAPTER 4 THE PROVABLY RECURSIVE FUNCTIONS OF ARITHMETIC
- CHAPTER 5 ACCESSIBLE RECURSIVE FUNCTIONS, ID<ω AND Π-CA0
- Part 3 Constructive logic and complexity
- BIBLIOGRAPHY
- INDEX
CHAPTER 5 - ACCESSIBLE RECURSIVE FUNCTIONS, ID<ω AND Π-CA0
from Part 2 - Provable recursion in classical systems
Published online by Cambridge University Press: 05 January 2012
- Frontmatter
- Contents
- PREFACE
- PRELIMINARIES
- Part 1 Basic proof theory and computability
- Part 2 Provable recursion in classical systems
- CHAPTER 4 THE PROVABLY RECURSIVE FUNCTIONS OF ARITHMETIC
- CHAPTER 5 ACCESSIBLE RECURSIVE FUNCTIONS, ID AND Π-CA0
- Part 3 Constructive logic and complexity
- BIBLIOGRAPHY
- INDEX
Summary
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Abook%3A9781139031905/resource/name/firstPage-9781139031905c5_p195-246_CBO.jpg)
- Type
- Chapter
- Information
- Proofs and Computations , pp. 195 - 246Publisher: Cambridge University PressPrint publication year: 2011