Definability and Computability

Ershov posits the view that computability-in the broadest sense-can be regarded as the Sigma-definability in the suitable sets. The volume also includes a novel exposition on the foundations of the theory of admissible sets with urelements, using the Gandy theorem throughout the theory's development.