Complexity, Logic, and Recursion Theory (Lecture Notes in Pure and Applied Mathematics)
By Andrea Sorbi.
Description
"Integrates two classical approaches to computability. Offers detailed coverage of recent research at the interface of logic, computability theory, nd theoretical computer science. Presents new, never-before-published results and provides informtion not easily accessible in the literature." - from Amzon
ISBN(s)
0824700260, 9780824700263
