The two main themes of this book, logic and complexity, are both essential for understanding the main problems about the foundations of mathematics. Logical Fou

New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.

The classical theory of computation has its origins in the work of Goedel, Turing, Church, and Kleene and has been an extraordinarily successful framework for t

Originally published in 1995 Time and Logic examines understanding and application of temporal logic, presented in computational terms. The emphasis in the book

By virtue of the close relationship between logic and relational databases, it turns out that complexity has important applications to databases such as analyzi