Computable Structures and the Hyperarithmetical Hierarchy (Studies in Logic and the Foundations of Mathematics) -- Hardback

Describes a program of research in computable structure theory. This book aims to find definability conditions corresponding to bounds on complexity which persist under isomorphism. It includes necessary background material from recursion theory and model theory.