On the quasi-ordering of borel linear orders under embeddability

Journal of Symbolic Logic 55 (2):537-560 (1990)
Abstract
We provide partial answers to the following problem: Is the class of Borel linear orders well-quasi-ordered under embeddability? We show that it is indeed the case for those Borel orders which are embeddable in R ω , with the lexicographic ordering. For Borel orders embeddable in R 2 , our proof works in ZFC, but it uses projective determinacy for Borel orders embeddable in some $\mathbf{R}^n, n , and hyperprojective determinacy for the general case
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 9,357
External links
  •   Try with proxy.
  •   Try with proxy.
  • Through your library Configure
    References found in this work BETA

    No references found.

    Citations of this work BETA

    No citations found.

    Similar books and articles
    Analytics

    Monthly downloads

    Sorry, there are not enough data points to plot this chart.

    Added to index

    2009-01-28

    Total downloads

    0

    Recent downloads (6 months)

    0

    How can I increase my downloads?

    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.