The two main themes of this book, logic and complexity, are both essential for understanding the main problems about the foundations of mathematics. Logical Fou

This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity. The first seven chapters include the

This volume discusses various aspects of Harvey Friedman's research in the foundations of mathematics over the past fifteen years. It should appeal to a wide au

From the winner of the Turing Award and the Abel Prize, an introduction to computational complexity theory, its connections and interactions with mathematics, a

Foundations of Computation is a free textbook for a one-semester course in theoretical computer science. It has been used for several years in a course at Hobar