Logic and Complexity
(Sprache: Englisch)
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,...
Leider schon ausverkauft
versandkostenfrei
Buch
146.50 €
Produktdetails
Produktinformationen zu „Logic and Complexity “
Klappentext zu „Logic and Complexity “
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.
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.
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.
Inhaltsverzeichnis zu „Logic and Complexity “
Part 1: Basic Model Theory and Computability- Propositional logic
- Deduction systems
- First order logic
- Completeness of first-order logic
- Models of computation
- Recursion and decidability
- Incompleteness of Peano Arithmetic
Part 2: Descriptive Complexity
- Complexity: time and space
- First order definability
- Inductive definitions and second order logic
- Models of parallel computations
- Space complexity: the classes L, FL, NL, PSPACE
- Definability of optimisation and counting problems
Part 3: Approximation and classes beyond NP
- Probabilistic classes
- Probabilistic verification
- Approximation
- Classes above NP
Bibliographische Angaben
- Autoren: Richard Lassaigne , Michel de Rougemont
- 2003, 361 Seiten, 65 Abbildungen, Maße: 16,5 x 25 cm, Gebunden, Englisch
- Verlag: Springer, London
- ISBN-10: 1852335653
- ISBN-13: 9781852335656
Sprache:
Englisch
Kommentar zu "Logic and Complexity"
0 Gebrauchte Artikel zu „Logic and Complexity“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Logic and Complexity".
Kommentar verfassen