Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-31T19:07:11.598Z Has data issue: false hasContentIssue false
  • English
  • Français

On the quasi-ordering of Borel linear orders under embeddability

Published online by Cambridge University Press:  12 March 2014

Alain Louveau  and
Jean Saint-Raymond
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
Get access Rights & Permissions [Opens in a new window]

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.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 55 , Issue 2 , June 1990 , pp. 537 - 560
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.)

References

REFERENCES

[DM]Dushnik, B. and Miller, E. W., Concerning similarity transformations of linearly ordered sets, Bulletin of the American Mathematical Society, vol. 46 (1940), pp. 322–326.CrossRefGoogle Scholar
[vEMS]van Engelen, F., Miller, A. W., and Steel, J., Rigid Borel sets and better quasiorder theory, Logic and combinatorics, Contemporary Mathematics, vol. 65, American Mathematical Society, Providence, Rhode Island, 1987, pp. 199–222.CrossRefGoogle Scholar
[HK]Harrington, L. and Kechris, A. S., On the determinacy of games on ordinals, Annals of Mathematical Logic, vol. 20 (1981), pp. 109–154.CrossRefGoogle Scholar
[HMS]Harrington, L., Marker, D. and Shelah, S., Borel orderings, Transactions of the American Mathematical Society, vol. 310 (1988), pp. 293–302.CrossRefGoogle Scholar
[La]Laver, R., On Fraïssé's order type conjecture, Annals of Mathematics, ser. 2, vol. 93 (1971), pp. 89–111.CrossRefGoogle Scholar
[Lo]Louveau, A., Two results on Borel orders, this Journal, vol. 54 (1989), pp. 865–874.Google Scholar
[M]Moschovakis, Y. N., Scales on coinductive sets, Cabal seminar 79–81, Lecture Notes in Mathematics, vol. 1019, Springer-Verlag, Berlin, 1983, pp. 77–85.CrossRefGoogle Scholar
[NW1]Nash-Williams, C. St. J. A., On well-quasi-ordering infinite trees, Proceedings of the Cambridge Philosophical Society, vol. 61 (1965), pp. 697–720.CrossRefGoogle Scholar
[NW2]Nash-Williams, C. St. J. A., On better-quasi-ordering transfinite sequences, Proceedings of the Cambridge Philosophical Society, vol. 64 (1968), pp. 273–290.CrossRefGoogle Scholar
[S]Simpson, S. G., Bqo theory and Fraïssés's conjecture, Chapter 9 in Mansfield, R. and Weitkamp, G., Recursive aspects of descriptive set theory, Oxford Logic Guides, vol. 11, Oxford University Press, Oxford, 1985, pp. 124–138.Google Scholar
[W]Woodin, W. H., private communication.Google Scholar