Code: 04449225
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 an ... more
You get 247 loyalty points
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
Book category Books in English Mathematics & science Mathematics Mathematical foundations
98.71 €
Collection points Bratislava a 2642 dalších
Copyright ©2008-24 najlacnejsie-knihy.sk All rights reservedPrivacyCookies
Shopping cart ( Empty )