Abstract.
This paper is a sequel to our [7]. In that paper we constructed a Π10 tree of avoidable points. Here we construct a Π10 tree of shadow points. This tree is a tree of sharp filters, where a sharp filter is a nested sequence of basic open sets converging to a point. In the construction we assign to each basic open set on the tree an address in 2<ω. One interesting fact is that while our Π10 tree of sharp filters (a subtree of Δ<ω) is isomorphic to the tree of addresses (a subtree of 2<ω), the tree of addresses is recursively enumerable but not recursive. To achieve this end we use a finite injury priority argument.
Similar content being viewed by others
References
Ceitin, G.S., Zaslavskii, I.D.: On singular coverings and properties of constructive functions connected with them (Russian). Tr. Mat. Inst. Steklov Akad. Nauk SSSR: Moskva 67, 458–502 (1962); Transl. in: Am. Math. Soc. Transl. Ser. 2(98), 41–89 (1971)
Cenzer, D., Remmel, J.B.: Π10 classes in mathematics. In: Ersov, Y., Goncharov, S., Nerode, A., Remmel, J. (eds.), North-Holland Studies in Logic and Found. Math., 138, 1998, pp. 623–821
Goodstein, R.L.: Recursive Analysis. North-Holland, Amsterdam 1961
Jockusch, C.G., Lewis, A.A., Remmel, J.B.: Π10-classes and Rado’s selection principle. J. Symbolic Logic 56, 684–693 (1991)
Jockusch, C.G., Soare, R.I.: Π10 classes and degrees of theories. Trans. Am. Math. Soc. 173, 33–56 (1972)
Jockusch, C.G., Soare, R.I.: Degrees of members of Π10 classes. Pacific J. Math. 40, 33–56 (1972)
Kalantari, I., Welch, L.: A blend of methods of recursion theory and topology. Ann. Pure Appl. Logic 124, 141–178 (2003)
Kalantari, I., Welch, L.: Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis. Electronic Notes in Theoretical Computer Science, 66, 2002, Elsevier Science Publishers
Kreitz, C., Weihrauch, K.: A unified approach to constructive and recursive analysis. In: Computation and Proof Theory, Boerger, E., Oberschelp, W., Richter, M.M., Schinzel, B., Thomas, W. (eds.), Logic Colloq. 1983 Aachen 2, Lect. Notes Math. 1104, Springer, Heidelberg, New York, 1984, pp. 259–278
Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. Springer: Heidelberg, New York, 1989
Rogers, H.: Theory of recursive functions and effective computability. McGraw-Hill, New York, 1967
Soare, R.I.: Recursively enumerable sets and degrees. Springer, Heidelberg, New York, 1987
Spreen, D.: A characterization of effective topological space. In: Proceedings 1989 Oberwolfach Meeting of Recursion Theory, Spies, A., et al. (eds.), Lecture Notes, Math, Springer
Turing, A.M.: On computable numbers, with an application to the ‘‘Entscheidungsproblem. Proc. London Math. Soc. Ser. 2 (42), 230–265 (1936); (Corr. Ibid. 43, 544–546 (1937))
Weihrauch, K.: Computable Analysis. Springer, Heidelberg, New York, 2000
Author information
Authors and Affiliations
Corresponding author
Additional information
Mathematics Subject Classification (2000): 03D45, 03D80, 03C57, 54A20
Rights and permissions
About this article
Cite this article
Kalantari, I., Welch, L. A blend of methods of recursion theory and topology: A Π10 tree of shadow points. Arch. Math. Logic 43, 991–1008 (2004). https://doi.org/10.1007/s00153-004-0244-0
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-004-0244-0