When is every recursive linear ordering of type μ recursively isomorphic to a polynomial time linear ordering over the natural numbers in binary form?

This publication has 5 references indexed in Scilit:

• Recursively Enumerable Sets and Degrees
  Published by Springer Nature ,1987
• Turing complexity of the ordinals
  Information Processing Letters, 1986
• A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings
  The Journal of Symbolic Logic, 1984
• Recursively categorical linear orderings
  Proceedings of the American Mathematical Society, 1981
• Autostability of models
  Algebra and Logic, 1980