Abstract.
We show how Kreisel's representation theorem for sets in the analytical hierarchy can be generalized to sets defined by positive induction and use this to estimate the complexity of constructions in the theory of domains with totality.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 21 January 1998 / Published online: 2 September 2002
Rights and permissions
About this article
Cite this article
Normann, D. Representation theorems for transfinite computability and definability. Arch. Math. Logic 41, 721–741 (2002). https://doi.org/10.1007/s001530200137
Issue Date:
DOI: https://doi.org/10.1007/s001530200137