Representation theorems for transfinite computability and definability |
| |
| Authors: | Dag Normann |
| |
| Institution: | (1) Matematisk Institut, P.B. 1053, Blindern, 0316 Oslo, Norway. e-mail: dnormann@ma-mail.uio.no, NO |
| |
| 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.
Received: 21 January 1998 / Published online: 2 September 2002 |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
