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 ...

Logic and Complexity 2012, Springer London Ltd, England

ISBN-13: 9781447110521


Logic and Complexity 2004, Springer, London, England

ISBN-13: 9781852335656

2004 edition