Delivery included to the United States

Proof and Computations

Proof and Computations - Perspectives in Logic

Hardback (15 Dec 2011)

Save $11.16

  • RRP $102.54
  • $91.38
Add to basket

Includes delivery to the United States

10+ copies available online - Usually dispatched within 2-3 weeks

Publisher's Synopsis

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.

About the Publisher

Cambridge University Press

Cambridge University Press dates from 1534 and is part of the University of Cambridge. We further the University's mission by disseminating knowledge in the pursuit of education, learning and research at the highest international levels of excellence.

Book information

ISBN: 9780521517690
Publisher: Cambridge University Press
Imprint: Cambridge University Press
Pub date:
DEWEY: 511.352
DEWEY edition: 23
Language: English
Number of pages: 465
Weight: 884g
Height: 158mm
Width: 233mm
Spine width: 29mm