youhelpme
07-09-2013, 04:09 AM
http://i48.fastpic.ru/big/2013/0628/fb/e12df54be84e8046d345922a127cd7fb.jpg
Proofs and Computations (Perspectives in Logic)
English | 480 pages | ISBN-10: 0521517699 | PDF | 3.67 MB
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 ?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.
Download:
http://dizzcloud.com/dl/1643lvf/kgybh.Proofs.and.Computations.Perspectives.in.Logi c.rar
or
http://uploaded.net/file/h74olycm/kgybh.Proofs.and.Computations.Perspectives.in.Logi c.rar
or
http://rapidgator.net/file/f2edbe82e2c5473f187710c841163cf7/kgybh.Proofs.and.Computations.Perspectives.in.Logi c.rar.html
Proofs and Computations (Perspectives in Logic)
English | 480 pages | ISBN-10: 0521517699 | PDF | 3.67 MB
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 ?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.
Download:
http://dizzcloud.com/dl/1643lvf/kgybh.Proofs.and.Computations.Perspectives.in.Logi c.rar
or
http://uploaded.net/file/h74olycm/kgybh.Proofs.and.Computations.Perspectives.in.Logi c.rar
or
http://rapidgator.net/file/f2edbe82e2c5473f187710c841163cf7/kgybh.Proofs.and.Computations.Perspectives.in.Logi c.rar.html