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.
University of Siena, Italy - ORCID: 0000-0001-9441-7226
pp.99-120
Duccio Pianigiani
Second incompleteness theorem: research developments and consequencespp.121-152
pp.155-172
pp.205-224
Titolo del libro
Lectures in Proof Theory and Complexity
Autori
Duccio Pianigiani
Opera sottoposta a peer review
Anno di pubblicazione
2025
Copyright
© 2025 Author(s)
Licenza d'uso
Licenza dei metadati
Editore
Firenze University Press, USiena Press
DOI
10.36253/979-12-215-0778-2
eISBN (pdf)
979-12-215-0778-2
eISBN (xml)
979-12-215-0779-9
Collana
UNIverSI. Ricerca e Didattica all’Università di Siena
ISSN della collana
3035-5915
e-ISSN della collana
3035-5931