Papers
Topics
Authors
Recent
Search
2000 character limit reached

N^N^N does not satisfy Normann's condition

Published 12 Oct 2010 in math.LO and cs.LO | (1010.2396v1)

Abstract: We prove that the Kleene-Kreisel space $NNN$ does not satisfy Normann's condition. A topological space $X$ is said to fulfil Normann's condition, if every functionally closed subset of $X$ is an intersection of clopen sets. The investigation of this property is motivated by its strong relationship to a problem in Computable Analysis. D. Normann has proved that in order to establish non-coincidence of the extensional hierarchy and the intensional hierarchy of functionals over the reals it is enough to show that $NNN$ fails the above condition.

Citations (2)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.