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

Price loading...

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

Name: Logic and Complexity (Discrete Mathematics and Theoretical Computer Science)
Brand: Springer

65 black & white illustrations

Architecture & Microprocessors

Price History & Forecast

No Price Data Available

Price history will appear here once data is collected from Amazon.

Price Distribution

No price data available for histogram

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)

Price History & Forecast

No Price Data Available

Price Distribution

Description

Product Specifications

Barcode

Similar Products You Might Like

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

Logic for Applications (Texts in Computer Science)

Logic and Language Models for Computer Science: Third Edition

Descriptive Complexity (Texts in Computer Science)

Mathematical Logic for Computer Science

Classical and New Paradigms of Computation and their Complexity Hierarchies: Papers of the conference "Foundations of the Formal Sciences III": 23 (Trends in Logic, 23)

A Logical Approach to Discrete Math (Monographs in Computer Science)

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

Springer - Logical Number Theory I: An Introduction

Computability

Logic of Mathematics: A Modern Course of Classical Logic: 22 (Pure and Applied Mathematics: A Wiley Series of Texts, Monographs and Tracts)

Logic Functions and Equations: Binary Models for Computer Science

Classical and New Paradigms of Computation and their Complexity Hierarchies: Papers of the conference "Foundations of the Formal Sciences III": 23 (Trends in Logic, 23)

The Calculus of Computation: Decision Procedures with Applications to Verification

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

Elements of Finite Model Theory (Texts in Theoretical Computer Science. An EATCS Series)

Propositional and Predicate Calculus: A Model of Argument

Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications (Undergraduate Topics in Computer Science)

Logic And Language Models For Computer Science (Third Edition)

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Theory of Computation (Texts in Computer Science)

Theory of Computation: Automata, Formal Languages, Computation and Complexity

Set Theory for Computing: From Decision Procedures to Declarative Programming with Sets (Monographs in Computer Science)

A Programming Approach to Computability (Monographs in Computer Science)