Mathematical Logic Quarterly 53 (3):301-305 (2007)

Let ⪯R be the preorder of embeddability between countable linear orders colored with elements of Rado's partial order . We show that ⪯R has fairly high complexity with respect to Borel reducibility , although its exact classification remains open
Keywords Rado's partial order  colored linear orders  Borel reducibility
Categories (categorize this paper)
DOI 10.1002/malq.200710002
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 62,363
Through your library

References found in this work BETA

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles


Added to PP index

Total views
23 ( #470,836 of 2,445,387 )

Recent downloads (6 months)
1 ( #457,131 of 2,445,387 )

How can I increase my downloads?


My notes