Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

N^N^N does not satisfy Normann's condition (1010.2396v1)

Published 12 Oct 2010 in math.LO and cs.LO

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

We haven't generated a summary for this paper yet.