This book presents a unifying framework for using priority arguments to prove theorems in computability.
This volume presents a systematic study of the interaction between local and global degree theory. It introduces the reader to the fascinating combinatorial methods of recursion theory while simultaneously showing how to use these methods to prove global theorems about degrees.