Bounded Arithmetic and Resolution-Based Proof Systems

Arnold Beckmann and Jan Johannsen
Collegium Logicum Volume 7, published by the Kurt Gödel Society
Publication year: 2004
External Link

This book is about two topics on the borderline between logic and complexity theory, and in particular about the connections between these. The first topic is Bounded Arithmetic, and the other is the complexity of propositional proof systems.

Leave a Reply

Your email address will not be published. Required fields are marked *