Richard Lassaigne, Michel De Rougemont

Logic and Complexity (eBook, PDF)

• Format: PDF

Produktbeschreibung

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.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer London
• Seitenzahl: 361
• Erscheinungstermin: 6. Dezember 2012
• Englisch
• ISBN-13: 9780857293923
• Artikelnr.: 43999693

Autorenporträt

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.

Inhaltsangabe

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.