Skip to content
Cart

Your Cart

×

You have 0 items in your cart.

Register Sign in Wishlist

Proofs and Computations

$87.00 (C)

Part of Perspectives in Logic

  • Date Published: January 2012
  • availability: Available
  • format: Hardback
  • isbn: 9780521517690

$ 87.00 (C)
Hardback

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    • 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
    Read more

    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

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: January 2012
    • format: Hardback
    • isbn: 9780521517690
    • length: 480 pages
    • dimensions: 236 x 160 x 30 mm
    • weight: 0.86kg
    • contains: 8 b/w illus.
    • availability: Available
  • Table of Contents

    Preface
    Preliminaries
    Part I. Basic Proof Theory and Computability:
    1. Logic
    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
    Bibliography
    Index.

  • Authors

    Helmut Schwichtenberg, Ludwig-Maximilians-Universität Munchen
    Helmut Schwichtenberg is an Emeritus Professor of Mathematics at Ludwig-Maximilians-Universität München. He has recently developed the 'proof-assistant' MINLOG, a computer-implemented logic system for proof/program development and extraction of computational content.

    Stanley S. Wainer, University of Leeds
    Stanley S. Wainer is an Emeritus Professor of Mathematics at the University of Leeds and a past-President of the British Logic Colloquium.

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

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 ×

Continue ×

Continue ×

Find content that relates to you

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×