Logic and Complexity (Discrete Mathematics and Theoretical Computer Science) - Image 1

£118.57

Springer Logic and Complexity (Discrete Mathematics and Theoretical Computer Science)

Name: Logic and Complexity (Discrete Mathematics and Theoretical Computer Science)
Brand: Springer
Price: 118.57 GBP
Availability: InStock

65 black & white illustrations

Architecture & Microprocessors

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

£119 today · all-time low £119 (May 2026) · usually the usual

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

Historical

Generating forecast…

Price Distribution

Price distribution over 53 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £119 (47 days, 88.7%)

Price range: £119 - £121

Price levels: 2 different prices over 53 days

Description

Logic and Complexity looks at basic logic as it is used in Computer Science, and provides students with a logical approach to Complexity theory. With plenty of exercises, this book presents classical notions of mathematical logic, such as decidability, completeness and incompleteness, as well as new ideas brought by complexity theory such as NP-completeness, randomness and approximations, providing a better understanding for efficient algorithmic solutions to problems. Divided into three parts, it covers: - Model Theory and Recursive Functions - introducing the basic model theory of propositional, 1st order, inductive definitions and 2nd order logic. Recursive functions, Turing computability and decidability are also examined. - Descriptive Complexity - looking at the relationship between definitions of problems, queries, properties of programs and their computational complexity. - Approximation - explaining how some optimization problems and counting problems can be approximated according to their logical form. Logic is important in Computer Science, particularly for verification problems and database query languages such as SQL. Students and researchers in this field will find this book of great interest.

Product Specifications

Brand: Springer
Model: 65 black & white illustrations
Format: hardcover
ASIN: 1852335653
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 20 January 2004
Listed Since: 22 January 2007

Barcode

No barcode data available

Springer Logic and Complexity (Discrete Mathematics and Theoretical Computer Science)

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

Logical Foundations of Mathematics and Computational Complexity: A Gentle Introduction (Springer Monographs in Mathematics)

Logic of Computation: SER F / v.157 (NATO ASI)

Logic for Computer Science and Artificial Intelligence

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

Computational Logic: Symposium Proceedings, Brussels, November 13/14, 1990 (ESPRIT Basic Research Series)

Computer Science Logic: 8th Workshop, CSL '94, Kazimierz, Poland, September 25 - 30, 1994. Selected Papers: 933 (Lecture Notes in Computer Science, 933)

Logical Foundations of Proof Complexity (Perspectives in Logic)

Proofs and Computations (Perspectives in Logic)

Mathematical Logic: 291 (Graduate Texts in Mathematics, 291)

Mathematical Logic: 291 (Graduate Texts in Mathematics, 291)

Complexity, Logic, and Recursion Theory: 187 (Lecture Notes in Pure and Applied Mathematics)

Logics for Computer and Data Sciences, and Artificial Intelligence: 992 (Studies in Computational Intelligence, 992)

Logic Colloquium '95: Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, held in Haifa, Israel, August 9–18, 1995: 11 (Lecture Notes in Logic, Series Number 11)

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

Mathematical Aspects of Logic Programming Semantics (Chapman & Hall/CRC Studies in Informatics Series)

Models and Computability: Invited Papers from Logic Colloquium '97, European Meeting of the Association for Symbolic Logic, Leeds, July 1997: 259 ... Lecture Note Series, Series Number 259)

Logic And Language Models For Computer Science (Third Edition)

Decidability of Logical Theories and Their Combination (Studies in Universal Logic)

Logic Colloquium 2007: 35 (Lecture Notes in Logic, Series Number 35)

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

Descriptive Complexity, Canonisation, and Definable Graph Structure Theory: 47 (Lecture Notes in Logic, Series Number 47)

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

Extensions of Logic Programming: Third International Workshop, ELP '92, Bologna, Italy, February 26-28, 1992. Proceedings: 660 (Lecture Notes in Computer Science, 660)

Logic for Computer Scientists (Modern Birkhäuser Classics)