Proofs and Computations
$68.00 ( ) USD
Part of Perspectives in Logic
- Helmut Schwichtenberg, Ludwig-Maximilians-Universität Munchen
- Stanley S. Wainer, University of Leeds
Adobe eBook Reader
Other available formats:
Looking for an examination copy?
This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact firstname.lastname@example.org providing details of the course you are teaching.
Driven by the question, 'What is the computational content of a (formal) proof?', this book studies fundamental interactions between proof theory and computability. It provides a unique self-contained text for advanced students and researchers in mathematical logic and computer science. Part I covers basic proof theory, computability and Gödel's theorems. Part II studies and classifies provable recursion in classical systems, from fragments of Peano arithmetic up to Π11–CA0. Ordinal analysis and the (Schwichtenberg–Wainer) subrecursive hierarchies play a central role and are used in proving the 'modified finite Ramsey' and 'extended Kruskal' independence results for PA and Π11–CA0. Part III develops the theoretical underpinnings of the first author's proof assistant MINLOG. Three chapters cover higher-type computability via information systems, a constructive theory TCF of computable functionals, realizability, Dialectica interpretation, computationally significant quantifiers and connectives and polytime complexity in a two-sorted, higher-type arithmetic with linear logic.Read more
- The first single source for students and researchers in this area
- Authors are acknowledged experts in the field
- Covers an important area of mathematics at the interface of logic and computer science
Reviews & endorsements
"Written by two leading practitioners in the area of formal logic, the book provides a panoramic view of the topic. This reference volume is a must for the bookshelf of every practitioner of formal logic and computer science."
Prahladavaradan Sampath, Computing Reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: February 2012
- format: Adobe eBook Reader
- isbn: 9781139210577
- contains: 8 b/w illus.
- availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
Table of Contents
Part I. Basic Proof Theory and Computability:
2. Recursion theory
3. Godel's theorems
Part II. Provable Recursion in Classical Systems:
4. The provably recursive functions of arithmetic
5. Accessible recursive functions, ID<ω and Π11–CA0
Part III. Constructive Logic and Complexity:
6. Computability in higher types
7. Extracting computational content from proofs
8. Linear two-sorted arithmetic
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email email@example.comRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×