Comparing hierarchies of total functionals

In this paper, we will address a problem raised by Bauer, Escardo and Simp- son. We define two hierarchies of total, continuous functionals over the reals based on domain theory, one based on an "extensional" representation of the reals and the other on an "intensional" representation. The problem is if these two hierarchies coincide. We will show that this coincidence problem is equivalent to the statement that the topology on the Kleene-Kreisel continuous functionals of a fixed type induced by all continuous functions into the reals is zero-dimensional for each type. As a tool of independent interest, we will construct topological embeddings of the Kleene-Kreisel functionals into both the extensional and the intensional hierarchy at each type. The embeddings will be hierarchy embeddings as well in the sense that they are the inclusion maps at type 0 and respect application at higher types.

[1]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[2]  Dag Normann,et al.  The continuous functionals of finite types over the reals , 1998, Workshop on Domains.

[3]  Thomas J. Grilliot.  On Effectively Discontinuous Type-2 Objects , 1971, J. Symb. Log..

[4]  Alex K. Simpson,et al.  Lazy Functional Algorithms for Exact Real Functionals , 1998, MFCS.

[5]  Pietro Di Gianantonio.  An Abstract Data Type for Real Numbers , 1999, Theor. Comput. Sci..

[6]  Pietro Di Gianantonio.  Pcf Extended with Real Numbers , 1996 .

[7]  Alex Simpson.  Mathematical Theory of Domains , 1998 .

[8]  D. Normann.  Recursion on the countable functionals , 1980 .

[9]  Andrej Bauer,et al.  Two constructive embedding‐extension theorems with applications to continuity principles and to Banach‐Mazur computability , 2004, Math. Log. Q..

[10]  Andrej Bauer,et al.  Comparing Functional Paradigms for Exact Real-Number Computation , 2002, ICALP.

[11]  D. Normann.  The countable functionals , 1980 .

[12]  Dag Normann,et al.  The Continuous Functionals , 1999, Handbook of Computability Theory.

[13]  Pietro Di Gianantonio.  Real Number Computability and Domain Theory , 1996, Inf. Comput..

[14]  Gordon D. Plotkin,et al.  Full abstraction, totality and PCF , 1999, Mathematical Structures in Computer Science.

[15]  Martín Hötzel Escardó,et al.  PCF Extended with Real Numbers , 1996, Theor. Comput. Sci..

[16]  K. Hofmann,et al.  Continuous Lattices and Domains , 2003 .

[17]  Douglas S. Bridges,et al.  Constructivity in Mathematics , 2004 .

[18]  Dag Normann.  Hierarchies of total functionals over the reals , 2004, Theor. Comput. Sci..

[19]  Pietro Di Gianantonio.  A Functional Approach to Computability on Real Numbers , 2005 .

[20]  Klaus Weihrauch,et al.  Computable Analysis , 2005, CiE.

[21]  Giuseppe Longo,et al.  The hereditary partial effective functionals and recursion theory in higher types , 1984, Journal of Symbolic Logic.

[22]  Delia Kesner,et al.  Theory and applications of explicit substitutions: Introduction , 2001, Mathematical Structures in Computer Science.

[23]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.