No CrossRef data available.
Article contents
The Complexity of the Collection of Countable Linear Orders of the form I + I
Published online by Cambridge University Press: 12 March 2014
Abstract
First we prove that the set of countable linear orders of the form I + I form a complete analytic set. As a consequence of this we improve a result of Humke and Laczkovich, who showed in [HL] that the set of functions of the form f º f form a true analytic set in C[0,1]. We show that these functions form a complete analytic set, solving a problem mentioned on p. 215 of [Kl] and on p. 4 of [B]
Keywords
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1999
References
REFERENCES
[B] Becker, H., Descriptive set theoretic phenomena in analysis and topology, Set theory of the continuum (Judah, H., Just, W., and Woodin, H., editors), no. 26, MSRI publications, Springer, 1992, pp. 1–25.Google Scholar
[FS] Friedman, H. and Stanley, L., A Borel reducibility theory for classes of countable structures, this Journal, vol. 54 (1989), pp. 894–914.Google Scholar
[HL] Humke, P. and Laczkovich, M., The Borel structure of iterates of continuous functions, Proceedings of the Edinburgh Mathematical Society, vol. 32, 1989, pp. 483–494.CrossRefGoogle Scholar
[K2] Kechris, A.S., On the concept of -completeness, Proceedings of the American Mathematical Society, vol. 125 (1997), pp. 1811–1814.CrossRefGoogle Scholar