Bounded Arithmetic, Propositional Logic and Complexity Theory: 60 (Encyclopedia of Mathematics and its Applications, Series Number 60) - Image 1

£95.22

Cambridge University Press Bounded Arithmetic, Propositional Logic and Complexity Theory: 60 (Encyclopedia of Mathematics and its Applications, Series Number 60)

Name: Bounded Arithmetic, Propositional Logic and Complexity Theory: 60 (Encyclopedia of Mathematics and its Applications, Series Number 60)
Brand: Cambridge University Press
Price: 91.2 GBP
Availability: InStock

Computer Science

About as cheap as it gets. The only time it was cheaper was 3 months ago.

£95 today · all-time low £91 (Feb 2026) · usually £97

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

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
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 90 days • 90 data points

Historical

Generating forecast...

Price Distribution

Price distribution over 90 days • 4 price levels

Days at Price

Current Price

Price Analysis

Most common price: £97 (74 days, 82.2%)

Price range: £91 - £114

Price levels: 4 different prices over 90 days

Description

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.

Product Specifications

Brand: Cambridge University Press
Format: hardcover
ASIN: 0521452058
Category: Books > Subjects > Computing & Internet > Computer Science
Domain: Amazon UK
Release Date: 24 November 1995
Listed Since: 09 February 2007

Barcode

No barcode data available

Cambridge University Press Bounded Arithmetic, Propositional Logic and Complexity Theory: 60 (Encyclopedia of Mathematics and its Applications, Series Number 60)

About as cheap as it gets. The only time it was cheaper was 3 months ago.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

The Mathematics of Logic: A Guide to Completeness Theorems and their Applications

A Model–Theoretic Approach to Proof Theory: 51 (Trends in Logic, 51)

Advanced Topics in Bisimulation and Coinduction: 52 (Cambridge Tracts in Theoretical Computer Science, Series Number 52)

Lectures in Logic and Set Theory: Volume 2, Set Theory: 83 (Cambridge Studies in Advanced Mathematics, Series Number 83)

The Semantics and Proof Theory of the Logic of Bunched Implications: 26 (Applied Logic Series, 26)

Programming with Higher-Order Logic

Combinatorics, Automata and Number Theory: 135 (Encyclopedia of Mathematics and its Applications, Series Number 135)

Matroid Applications: 40 (Encyclopedia of Mathematics and its Applications, Series Number 40)

Sheaves, Games, and Model Completions: A Categorical Approach to Nonclassical Propositional Logics: 14 (Trends in Logic, 14)

Quantifiers, Propositions and Identity: Admissible Semantics for Quantified Modal and Substructural Logics: 38 (Lecture Notes in Logic, Series Number 38)

Problems in Set Theory, Mathematical Logic and the Theory of Algorithms (University Series in Mathematics)

Handbook of Categorical Algebra: Volume 1, Basic Category Theory: 50 (Encyclopedia of Mathematics and its Applications, Series Number 50)

Noncommutative Rational Series with Applications: 137 (Encyclopedia of Mathematics and its Applications, Series Number 137)

Between Logic and Intuition: Essays in Honor of Charles Parsons

The Argument of Mathematics: 30 (Logic, Epistemology, and the Unity of Science, 30)

Combinatorial Machine Learning: A Rough Set Approach: 360 (Studies in Computational Intelligence, 360)

Between Logic and Reality: Modeling Inference, Action and Understanding: 25 (Logic, Epistemology, and the Unity of Science, 25)

Kolmogorov Complexity and Computational Complexity (Monographs in Theoretical Computer Science. An EATCS Series)

Abductive Inference: Computation, Philosophy, Technology

Categories for Types (Studies in Emotion and Social Interaction)

Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)

Domains and Lambda-Calculi: 46 (Cambridge Tracts in Theoretical Computer Science, Series Number 46)

Topics in Philosophical Logic: 17 (Synthese Library, 17)

Design Theory: Volume 2: 78 (Encyclopedia of Mathematics and its Applications, Series Number 78)