Proofs and Computations (BOK)

Helmut Schwichtenberg

849,00 84900
Sendes vanligvis innen 5-15 dager
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 Godel's theorems. Part II studies and classifies provable recursion in classical systems, from fragments of Peano arithmetic up to PI11-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 PI11-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.

Produktfakta

Språk Engelsk Engelsk Innbinding Innbundet
Utgitt 2011 Forfatter Helmut Schwichtenberg
Forlag
CAMBRIDGE UNIVERSITY PRESS
ISBN 9780521517690
Antall sider 480 Dimensjoner 16,5cm x 24,1cm x 3,2cm
Vekt 878 gram Leverandør Bertram Trading Ltd