The series is devoted to the publication of high-level monographs on all areas of mathematical logic and its applications. It is addressed to advanced students

This monograph presents recursion theory from a generalized point of view centered on the computational aspects of definability. A major theme is the study of t

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

S. Homer: Admissible recursion theory.- B.E. Jacobs: Computational complexity and recursion theory.- D. Normann: A survey of set recursion.- G.E. Sacks: Priorit

Computability Theory: An Introduction to Recursion Theory provides a concise, comprehensive, and authoritative introduction to contemporary computability theory