Classical computable model theory is most naturally concerned with countable domains. There are, however, several methods – some old, some new – that have e

This book is a brief and focused introduction to the reverse mathematics and computability theory of combinatorial principles, an area of research which has see

Ordinal Computability discusses models of computation obtained by generalizing classical models, such as Turing machines or register machines, to transfinite wo

Presents main results and techniques in computable structure theory together in a coherent framework for the first time in 20 years.

Goncharov and Peretyat'kin independently gave necessary and sufficient conditions for when a set of types of a complete theory is the type spectrum of some homo