Representation theorems for transfinite computability and definability

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. [PUBLICATION ABSTRACT]

Saved in:
Bibliographic Details
Published in:Archive for mathematical logic 2002-11, Vol.41 (8), p.721-741
Main Author: Normann, Dag
Format: Article
Language:English
Subjects:
Logic
Mathematics
Set theory
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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. [PUBLICATION ABSTRACT]
ISSN:0933-5846
1432-0665
DOI:10.1007/s001530200137