The 16 papers reflect some of the breakthroughs over the past dozen years in understanding whether or not logical inferences can be made in certain situations a

Proof complexity is a rich subject drawing on methods from logic, combinatorics, algebra and computer science. This self-contained book presents the basic conce

This book principally concerns the rapidly growing area of "Logical Complexity Theory", the study of bounded arithmetic, propositional proof systems, length of

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

An overview of current developments in research on feasible computations; and its relation to provable properties of complexity of computations.