Produkt mají v nabídce:
Logical Foundations of Proof Complexity - Cook, Stephen (University of Toronto) a Nguyen, Phuong (McGill University, Montreal)
This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity. The first seven chapters include the necessary logical background for the material and are suitable for a graduate course. The result is a uniform treatment of many systems in the literature.
