1 research outputs found
A Note on Computable Embeddings for Ordinals and Their Reverses
We continue the study of computable embeddings for pairs of structures, i.e.
for classes containing precisely two non-isomorphic structures. Surprisingly,
even for some pairs of simple linear orders, computable embeddings induce a
non-trivial degree structure. Our main result shows that although is computably embeddable in , the class is
\emph{not} computably embeddable in for any
natural number .Comment: 13 pages, accepted to CiE 202