We can't find the internet
Attempting to reconnect
Something went wrong
Hang in there while we get back on track
£93.29
Cambridge University Press Cambridge Logical Foundations of Proof Complexity Book
Price data updated today
We'll watch every seller, every day. One email when your price arrives.
This is the usual price. Wait for it to drop, or tell us your number.
£93 today · usual range £77–£98 · best ever £77
NEW HERE?
Amazon shows you one price. We show you all of them.
Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.
WHAT'S ON THIS PAGE
when this has been cheap or pricey
where the price is heading next
all-time high & low, recent range
name your number, we'll email you
Price History & Forecast
Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.
Last 91 days · 91 data points
Price Distribution
Price distribution over 91 days • 7 price levels
Price Analysis
Most common price: £95 (43 days, 47.3%)
Price range: £77 - £98
Price levels: 7 different prices over 91 days
Description
Key Features
Comprehensive logical background provided in the first seven chapters for graduate students.
Connects bounded arithmetic and propositional proof complexity to computational complexity.
Covers a wide range of complexity classes from AC0 up to the polynomial hierarchy.
Links complexity classes to two-sorted predicate calculus theories and propositional proof systems.
Explains the translation of bounded theorems into families of quantified propositional proofs.
Product Specifications
- Format
- hardcover
- ASIN
- 052151729X
- Domain
- Amazon UK
- Release Date
- 25 January 2010
- Listed Since
- 21 September 2009
Barcode
No barcode data available
Similar Products You Might Like
Bounded Arithmetic, Propositional Logic and Complexity Theory: 60 (Encyclopedia of Mathematics and its Applications, Series Number 60)
Cambridge University Press
Structural Proof Theory
Cambridge University Press
Cambridge Mathematics of Logic - Completeness Theorems Guide
Cambridge University Press
Programming with Higher-Order Logic
Cambridge University Press
Acceptable Premises: An Epistemic Approach to an Informal Logic Problem
Cambridge University Press
Proof Theory of Modal Logic: 2 (Applied Logic Series, 2)
Springer
Lectures in Logic and Set Theory: Volume 2, Set Theory: 83 (Cambridge Studies in Advanced Mathematics, Series Number 83)
Cambridge University Press
Logics for Computer Science: Classical and Non-Classical
Springer
Advanced Topics in Bisimulation and Coinduction: 52 (Cambridge Tracts in Theoretical Computer Science, Series Number 52)
Cambridge University Press
Abductive Inference: Computation, Philosophy, Technology
Cambridge University Press
P, Np, and Np-Completeness: The Basics of Computational Complexity
Cambridge University Press
Handbook of Computability Theory (Volume 140) (Studies in Logic and the Foundations of Mathematics, Volume 140)
Elsevier
Bounded Queries in Recursion Theory: 16 (Progress in Computer Science and Applied Logic, 16)
Birkhauser
A Model–Theoretic Approach to Proof Theory: 51 (Trends in Logic, 51)
Springer
Quantifiers, Propositions and Identity: Admissible Semantics for Quantified Modal and Substructural Logics: 38 (Lecture Notes in Logic, Series Number 38)
Cambridge University Press
Goal-Directed Proof Theory: 21 (Applied Logic Series, 21)
Springer
Proof Theory and Automated Deduction: 6 (Applied Logic Series, 6)
Springer
Categories for Types (Studies in Emotion and Social Interaction)
Cambridge University Press
Sheaves, Games, and Model Completions: A Categorical Approach to Nonclassical Propositional Logics: 14 (Trends in Logic, 14)
Springer
First-Order Schemata and Inductive Proof Analysis (Computer Science Foundations and Applied Logic)
Birkhauser
The Foundations of Computability Theory
Springer
The Semantics and Proof Theory of the Logic of Bunched Implications: 26 (Applied Logic Series, 26)
Springer
Problems in Set Theory, Mathematical Logic and the Theory of Algorithms (University Series in Mathematics)
Springer
An Introduction to Formal Languages and Machine Computation
Scientific Publishing