This book introduces first order stability theory, organized around the spectrum problem, with complete proofs of the Vaught conjecture for omega-stable theories.

This volume presents a unified and coherent account of the many and various parts of general recursion theory.

The theory set out in this book results from the meeting of descriptive set theory and recursion theory.

This book brings together several directions of work in model theory between the late 1950s and early 1980s.

This volume makes the basic facts about admissible sets accessible to logic students and specialists alike.

This volume bridges the gap between a first-year graduate logic course and research papers in stability theory.

A much-needed monograph on the metamathematics of first-order arithmetic, paying particular attention to fragments of Peano arithmetic.

This almost self-contained introduction to higher recursion theory is essential reading for all researchers in the field.

The first graduate-level treatment of computable analysis within the tradition of classical mathematical reasoning.

A comprehensive account of the theory of constructible sets at an advanced level, aimed at graduate mathematicians.