Proofs and Computations PDF (Adobe DRM) download by Helmut Schwichtenberg

Proofs and Computations

Cambridge University Press
Publication date: December 2011
ISBN: 9781139210577
Digital Book format: PDF (Adobe DRM)


List price:
Our price:

You save: $5.01 (7%)
Join our Facebook sweepstake, share and
get 10 likes. Winners
get notified in 24H!
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.
Please sign in to review this product.
Proofs and Computations PDF (Adobe DRM) can be read on any device that can open PDF (Adobe DRM) files.

File Size:
2883 Kb
Copy From Text:
Enabled. Limit of 5 selections within 30 days.
Enabled. Limit of 20 pages within 30 days.