Discrete Mathematics and Theoretical Computer Science

Logic and Complexity

Authors: Lassaigne, Richard, Rougemont, Michel de

Buy this book

eBook $179.00
price for USA (gross)
  • ISBN 978-0-85729-392-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $229.00
price for USA
  • ISBN 978-1-85233-565-6
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $229.00
price for USA
  • ISBN 978-1-4471-1052-1
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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.

Table of contents (19 chapters)

Buy this book

eBook $179.00
price for USA (gross)
  • ISBN 978-0-85729-392-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $229.00
price for USA
  • ISBN 978-1-85233-565-6
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $229.00
price for USA
  • ISBN 978-1-4471-1052-1
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Logic and Complexity
Authors
Series Title
Discrete Mathematics and Theoretical Computer Science
Copyright
2004
Publisher
Springer-Verlag London
Copyright Holder
Springer-Verlag London
eBook ISBN
978-0-85729-392-3
DOI
10.1007/978-0-85729-392-3
Hardcover ISBN
978-1-85233-565-6
Softcover ISBN
978-1-4471-1052-1
Edition Number
1
Number of Pages
X, 361
Topics