A clear and focused introduction to recursion theory that is ideal for teaching and self-study.

Proceedings of the Association for Symbolic Logic meeting held in Helsinki, Finland, in 1990, containing eighteen papers by leading researchers.

This book constructs an inner model with a Woodin cardinal and develops its fine structure theory using the theory of iteration trees.

These notes develop the theory of descriptive sets, leading up to a new proof of Louveau's separation theorem for analytic sets.

This groundbreaking, yet accessible book explores the interaction between graph theory and computational complexity using methods from finite model theory.