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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.