Explore
Lectures in Proof Theory and Complexity
Pianigiani Duccio
2025
0 Ungluers have
Faved this Work
Login to Fave
The book is based on lecture notes from the course ‘Formal Systems’, taught by the author for the Master’s Degree in ‘Applied Mathematics’ at the University of Siena. It was created for educational purposes, specifically for second-level (graduate) courses. The work is mainly oriented towards applications of Proof Theory — one of the macro-areas into which Mathematical Logic is divided — to Computability Theory and Computational Complexity Theory, albeit with entanglements with Model Theory and with Category Theory. The book begins with some classical results concerning formal arithmetic, dating back to the 1930s, and then compares them with more recent developments, emphasising the acceleration imparted to logical study by the development of computer science.
This book is included in DOAB.
Why read this book? Have your say.
You must be logged in to comment.
Rights Information
Are you the author or publisher of this work? If so, you can claim it as yours by registering as an Unglue.it rights holder.Downloads
This work has been downloaded 0 times via unglue.it ebook links.
- 0 - pdf (CC BY-SA) at OAPEN Library.
Keywords
- Category theory
- Computational complexity
- Lambda calculus
- Mathematical logic
- Proof theory
- thema EDItEUR::P Mathematics and Science::PB Mathematics::PBC Mathematical foundations
Links
DOI: 10.36253/979-12-215-0778-2Editions