Proofs and Computations

Proofs and Computations
Author :
Publisher : Cambridge University Press
Total Pages : 480
Release :
ISBN-10 : 9781139504164
ISBN-13 : 1139504169
Rating : 4/5 (64 Downloads)

Book Synopsis Proofs and Computations by : Helmut Schwichtenberg

Download or read book Proofs and Computations written by Helmut Schwichtenberg and published by Cambridge University Press. This book was released on 2011-12-15 with total page 480 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.


Proofs and Computations Related Books

Proofs and Computations
Language: en
Pages: 480
Authors: Helmut Schwichtenberg
Categories: Mathematics
Type: BOOK - Published: 2011-12-15 - Publisher: Cambridge University Press

DOWNLOAD EBOOK

Driven by the question, 'What is the computational content of a (formal) proof?', this book studies fundamental interactions between proof theory and computabil
Mathematics and Computation
Language: en
Pages: 434
Authors: Avi Wigderson
Categories: Computers
Type: BOOK - Published: 2019-10-29 - Publisher: Princeton University Press

DOWNLOAD EBOOK

From the winner of the Turing Award and the Abel Prize, an introduction to computational complexity theory, its connections and interactions with mathematics, a
Computational Complexity
Language: en
Pages: 609
Authors: Sanjeev Arora
Categories: Computers
Type: BOOK - Published: 2009-04-20 - Publisher: Cambridge University Press

DOWNLOAD EBOOK

New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.
Arithmetic, Proof Theory, and Computational Complexity
Language: en
Pages: 442
Authors: Peter Clote
Categories: Mathematics
Type: BOOK - Published: 1993-05-06 - Publisher: Clarendon Press

DOWNLOAD EBOOK

This book principally concerns the rapidly growing area of "Logical Complexity Theory", the study of bounded arithmetic, propositional proof systems, length of
Numerical Verification Methods and Computer-Assisted Proofs for Partial Differential Equations
Language: en
Pages: 469
Authors: Mitsuhiro T. Nakao
Categories: Mathematics
Type: BOOK - Published: 2019-11-11 - Publisher: Springer Nature

DOWNLOAD EBOOK

In the last decades, various mathematical problems have been solved by computer-assisted proofs, among them the Kepler conjecture, the existence of chaos, the e