Computer Science – Logic in Computer Science
Scientific paper
2009-09-07
LMCS 5 (3:11) 2009
Computer Science
Logic in Computer Science
21 pages
Scientific paper
10.2168/LMCS-5(3:11)2009
We are considering typed hierarchies of total, continuous functionals using complete, separable metric spaces at the base types. We pay special attention to the so called Urysohn space constructed by P. Urysohn. One of the properties of the Urysohn space is that every other separable metric space can be isometrically embedded into it. We discuss why the Urysohn space may be considered as the universal model of possibly infinitary outputs of algorithms. The main result is that all our typed hierarchies may be topologically embedded, type by type, into the corresponding hierarchy over the Urysohn space. As a preparation for this, we prove an effective density theorem that is also of independent interest.
No associations
LandOfFree
A rich hierarchy of functionals of finite types does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A rich hierarchy of functionals of finite types, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A rich hierarchy of functionals of finite types will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-295642