Logic and Complexity
Published on 20. January 2004
Book
Hardback
X, 361 pages
978-1-85233-565-6 (ISBN)
Description
Logic and Complexity introduces some of the fundamental ideas of Logic for Computer Science, by explaining the classical notions of mathematical logic, alongside new ideas brought by complexity theory.
More details
Series
Edition
2004 edition
Language
English
Place of publication
London
United Kingdom
Target group
Professional and scholarly
Research
Product notice
sewn/stitched
Cloth over boards
Illustrations
X, 361 p.
Dimensions
Height: 250 mm
Width: 165 mm
Thickness: 22 mm
Weight
644 gr
ISBN-13
978-1-85233-565-6 (9781852335656)
DOI
10.1007/978-0-85729-392-3
Schweitzer Classification
Other editions
Additional editions
Richard Lassaigne | Michel De Rougemont
Logic and Complexity
Book
10/2012
Springer
€171.19
Shipment within 15-20 days
Content
1. Basic model theory and computability.- 1. Propositional logic.- 2. Deduction systems.- 3. First-order logic.- 4. Completeness of first order logic.- 5. Models of computation.- 6. Recursion and decidability.- 7. Incompleteness of Peano arithmetic.- 2. Descriptive Complexity.- 8 Complexity: time and space.- 9. First-order definability.- 10. Inductive definitions and second-order logic.- 11. Time complexity : the classes P and NP.- 12. Models of parallel computations.- 13. Space complexity: the classes L, FL, NL and PSPACE.- 14. Definability of optimization and counting problems.- 3. Approximation and classes beyond NP.- 15. Probabilistic Classes.- 16. Probabilistic verification.- 17. Approximation.- 18. Classes beyond NP.- List of Figures.