Stock image for illustration purposes only - book cover, edition or condition may vary.
Bounded Arithmetic, Propositional Logic and Complexity Theory
Jan Krajicek
€ 154.72
FREE Delivery in Ireland
Description for Bounded Arithmetic, Propositional Logic and Complexity Theory
Discusses the deep connections between logic and complexity theory, and lists a number of intriguing open problems. Series Editor(s): Rota, Gian-Carlo; Doran, B.; Ismail, M.; Lam, T. Y.; Wutwak, E.; Flajolet, Philippe; Lutwak, E. Series: Encyclopedia of Mathematics and Its Applications. Num Pages: 360 pages, references, index. BIC Classification: PBCD; UYA. Category: (P) Professional & Vocational. Dimension: 228 x 152 x 24. Weight in Grams: 700.
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 ... Read more
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 ... Read more
Product Details
Format
Hardback
Publication date
1995
Publisher
Cambridge University Press United Kingdom
Number of pages
360
Condition
New
Series
Encyclopedia of Mathematics and Its Applications
Number of Pages
360
Place of Publication
Cambridge, United Kingdom
ISBN
9780521452052
SKU
V9780521452052
Shipping Time
Usually ships in 4 to 8 working days
Ref
99-1
Reviews for Bounded Arithmetic, Propositional Logic and Complexity Theory
'This interesting book provides a brisk account of current research in bounded arithmetic and the complexity of propositional logic.' Mathematika 'It can be strongly recommended especially to mathematicians and computer scientists working in the field and to graduate students.' European Mathematical Society Newsletter