Results 1 -
4 of
4
Comparing hierarchies of total functionals
- Logical Methods in Computer Science
, 2005
"... In this paper, we will address a problem raised by Bauer, Escardó and Simpson. 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 i ..."
Abstract
-
Cited by 5 (3 self)
- Add to MetaCart
In this paper, we will address a problem raised by Bauer, Escardó and Simpson. 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
mlq header will be provided by the publisher On Local Non-Compactness in Recursive Mathematics
"... theory ..."
Realizability Models Refuting Ishihara’s Boundedness Principle
, 2011
"... In [Ish92] H. Ishihara introduced the so-called boundedness principle BD-N which claims that every countable pseudobounded subset of N is bounded. Here S ⊆ N is called pseudobounded iff for every sequence a ∈ SN there exists an n ∈ N such that ak < k for all k ≥ n. 1 Obviously, the principle BD-N is ..."
Abstract
- Add to MetaCart
In [Ish92] H. Ishihara introduced the so-called boundedness principle BD-N which claims that every countable pseudobounded subset of N is bounded. Here S ⊆ N is called pseudobounded iff for every sequence a ∈ SN there exists an n ∈ N such that ak < k for all k ≥ n. 1 Obviously, the principle BD-N is

