Logic and Complexity (Discrete Mathematics and Theoretical Computer Science) - Tapa dura

Rougemont, Michel De; Lassaigne, Richard

 
9781852335656: Logic and Complexity (Discrete Mathematics and Theoretical Computer Science)
Tapa dura
ISBN 10: 1852335653 ISBN 13: 9781852335656
Editorial: Springer, 2004

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer
Año de publicación
2004
Idioma
Inglés
ISBN 10 
1852335653
ISBN 13 
9781852335656
Encuadernación
Tapa dura
Número de páginas
376
Contacto del fabricante
ROXIO
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
22391
Alemania

Otras ediciones populares con el mismo título

9781447110521: Logic and Complexity (Discrete Mathematics and Theoretical Computer Science)

Edición Destacada

ISBN 10:  1447110528 ISBN 13:  9781447110521
Editorial: Springer, 2012
Tapa blanda