Overview

This book presents an up-to-date, unified treatment of research in bounded arithmetic and complexity of propositional logic, with emphasis on independence proofs and lower bound proofs. The author discusses the deep connections between logic and complexity theory and lists a number of intriguing open problems. An introduction to the basics of logic and complexity theory is followed by discussion of important results in propositional proof systems and systems of bounded arithmetic. More advanced topics are then treated, including polynomial simulations and conservativity results, various witnessing theorems, the translation of bounded formulas (and their proofs) into propositional ones, the method of random partial restrictions and its applications, direct independence proofs, complete systems of partial relations, lower bounds to the size of constant-depth propositional proofs, the method of Boolean valuations, the issue of hard tautologies and optimal proof systems, combinatorics and complexity theory within bounded arithmetic, and relations to complexity issues of predicate calculus. Students and researchers in mathematical logic and complexity theory will find this comprehensive treatment an excellent guide to this expanding interdisciplinary area.

ISBN-13

9780521452052

ISBN-10

0521452058

Weight

1.48 Pounds

Dimensions

6.38 x 1.07 x 9.52 In

List Price

$151.00

Edition

1st Edition

Format

Hardcover

Language

English

Pages

360 pages

Publisher

Cambridge University Press

Published On

1995-11-24



View All Offers

Sort by:

Condition
Seller
Seller Comments
Price
Used, Like New
Seller details
Zubal Books
★★★★★

Cleveland, OH, USA

360 pp., Hardcover, ownership markings to the front free endpaper and fore edge, else fine in a fi...
$121.04

 Free delivery by: 30 Mar 2026


Bookstores.com relies on cookies to improve your experience.