Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T08:32:38.610Z Has data issue: false hasContentIssue false

On the quasi-ordering of Borel linear orders under embeddability

Published online by Cambridge University Press:  12 March 2014

Alain Louveau
Affiliation:
Équipe D'Analyse, Université Paris-VI, 75252 Paris, France
Jean Saint-Raymond
Affiliation:
Équipe D'Analyse, Université Paris-VI, 75252 Paris, France

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 R2, our proof works in ZFC, but it uses projective determinacy for Borel orders embeddable in some Rn, n < ω, and hyperprojective determinacy for the general case.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1990

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable