The complexity of the collection of countable linear orders of the form I + I

Journal of Symbolic Logic 64 (4):1519-1526 (1999)
  Copy   BIBTEX

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 [K1] and on p. 4 of [B]

Other Versions

original Beleznay, Ferenc (1999) "The Complexity of the Collection of Countable Linear Orders of the Form I + I". Journal of Symbolic Logic 64(4):1519-1526

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 96,411

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
210 (#106,681)

6 months
14 (#353,310)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Descriptive Set Theory.Yiannis Nicholas Moschovakis - 1982 - Studia Logica 41 (4):429-430.

Add more references