Logical Foundations of Proof Complexity (Perspectives in Logic) - Image 1

£58.99

Cambridge University Press Logical Foundations of Proof Complexity (Perspectives in Logic)

Name: Logical Foundations of Proof Complexity (Perspectives in Logic)
Brand: Cambridge University Press
Price: 58.99 GBP
Availability: InStock

Computer Science

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

£59 today · all-time low £59 (May 2026) · usually £59

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 66 days · 66 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 66 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £59 (62 days, 93.9%)

Price range: £59 - £60

Price levels: 2 different prices over 66 days

Description

This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity. The first seven chapters include the necessary logical background for the material and are suitable for a graduate course. Associated with each of many complexity classes are both a two-sorted predicate calculus theory, with induction restricted to concepts in the class, and a propositional proof system. The complexity classes range from AC0 for the weakest theory up to the polynomial hierarchy. Each bounded theorem in a theory translates into a family of (quantified) propositional tautologies with polynomial size proofs in the corresponding proof system. The theory proves the soundness of the associated proof system. The result is a uniform treatment of many systems in the literature, including Buss's theories for the polynomial hierarchy and many disparate systems for complexity classes such as AC0, AC0(m), TC0, NC1, L, NL, NC, and P.

Product Specifications

Brand: Cambridge University Press
Format: paperback
ASIN: 1107694116
Category: Books > Subjects > Computing & Internet > Computer Science
Domain: Amazon UK
Release Date: 06 March 2014
Listed Since: 16 January 2014

Barcode

No barcode data available

Cambridge University Press Logical Foundations of Proof Complexity (Perspectives in Logic)

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

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Basic Proof Theory 2ed: 43 (Cambridge Tracts in Theoretical Computer Science, Series Number 43)

Proof Complexity Generators: Series Number 497 (London Mathematical Society Lecture Note Series, Series Number 497)

Proof Analysis: A Contribution to Hilbert's Last Problem

Classical and Fuzzy Concepts in Mathematical Logic and Applications, Professional Version

Mathematical Logic through Python

Proofs and Computations (Perspectives in Logic)

Part 1: Propositional Calculus, Boolean Algebras, Predicate Calculus, Completeness Theorems: A Course with Exercises Part I: Propositional Calculus, ... Completeness Theorems (Mathematical Logic)

Computational Logic: 165 (NATO ASI Subseries F:, 165)

Logic and Complexity (Discrete Mathematics and Theoretical Computer Science)

A First Course in Logic : An Introduction to Model Theory, Proof Theory, Computability, and Complexity: An Introduction to Model Theory, Proof Theory, ... and Complexity: 1 (Oxford Texts in Logic)

Logique mathématique - Tome 2 - Fonctions récursives, théorème de Gödel, théorie des ensembles: T 2 - Fonctions récursives, théorème de Gödel, théorie des ensembles

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

Propositional Logics Third Edition

Logic for Applications (Texts in Computer Science)

Proof Theory and Logic Programming: Computation as Proof Search

Mathematical Logic: Exercises and Solutions (Problem Books in Mathematics)

An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof: 27 (Applied Logic Series, 27)

Mathematical Logic in Asia: Proceedings of the 9th Asian Logic Conference

Mathematical Logic and Formalized Theories: A Survey of Basic Concepts and Results

Proof and Computation: 139 (NATO ASI Subseries F:, 139)

Logic and Implication: An Introduction to the General Algebraic Study of Non-classical Logics: 57 (Trends in Logic, 57)

Logic for Computer Science and Artificial Intelligence

Substructural Logics: A Primer: 13 (Trends in Logic, 13)

Resolution Proof Systems: An Algebraic Theory: 4 (Automated Reasoning Series, 4)