Logical Foundations of Proof Complexity

Name: Logical Foundations of Proof Complexity
Author: Stephen (University of Toronto) Cook

Stephen (University of Toronto) Cook, Montreal) Phuong (McGill University Nguyen

Cambridge University Press

Knihu koupíte v 1 e-shopu

Bookshop.cz

3 281 Kč

Není skladem

Do obchodu

Krátký popis

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.

Výběr knih vydavatele Cambridge University Press