Bounded Arithmetic, Propositional Logic and Complexity Theory Krajicek Hardback
Bounded Arithmetic, Propositional Logic and Complexity TheoryAuthor(s): Jan Krajicek\nFormat: Hardback\nPublisher: Cambridge University Press, United Kingdom\nImprint: Cambridge University Press\nISBN-13: 9780521452052, 978-0521452052\nSynopsis\nThis 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 applica.
Compare prices (2 shops)
| shop | Price | Action |
|---|---|---|
|
114,98 GBP | Go to shop |
|
|
123,89 GBP | Go to shop |
Similar products
-
Depth-bounded Reasoning. Classical Propositional Logic
From 16,50 EUR -
Complexity, Logic, and Recursion Theory
From 190,00 EUR -
-
-
-
