Bounded Arithmetic, Propositional Logic, and Complexity Theory

Cambridge University Press (1995)
Abstract
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.
Keywords Constructive mathematics  Proposition (Logic  Computational complexity
Categories (categorize this paper)
Buy the book $94.33 used (47% off)   $135.39 new (24% off)   $153.10 direct from Amazon (14% off)    Amazon page
Call number QA9.56.K73 1995
ISBN(s) 0521452058   9780521452052
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 10,768
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Citations of this work BETA
Mihai Ganea (2010). Two (or Three) Notions of Finitism. Review of Symbolic Logic 3 (1):119-144.
Morteza Moniri (2007). Preservation Theorems for Bounded Formulas. Archive for Mathematical Logic 46 (1):9-14.
Similar books and articles
Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

7 ( #183,968 of 1,098,999 )

Recent downloads (6 months)

4 ( #80,012 of 1,098,999 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.