Hostname: page-component-cd9895bd7-lnqnp Total loading time: 0 Render date: 2024-12-29T20:01:20.513Z Has data issue: false hasContentIssue false
  • English
  • Français

Decidable discrete linear orders

Published online by Cambridge University Press:  12 March 2014

M. Moses
M. Moses*
Affiliation:
Department of Mathematics, Western Illinois University, Macomb, Illinois 61455
Get access Rights & Permissions [Opens in a new window]

Abstract

Three classes of decidable discrete linear orders with varying degrees of effectiveness are investigated. We consider how a classical order type may lie in relation to these three classes, and we characterize by their order types elements of these classes that have effective nontrivial self-embeddings.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 53 , Issue 2 , June 1988 , pp. 531 - 539
Copyright
Copyright © Association for Symbolic Logic 1988

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.)

Footnotes

1

The author wishes to acknowledge helpful discussions with Iraj Kalantari and the invaluable assistance of Carolina Hinestrosa.

References

REFERENCES

[1] 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
[2] Langford, C. H., Theorems on deducibility, Annals of Mathematics, ser. 2, vol. 28 (1927), pp. 459–471.CrossRefGoogle Scholar
[3] Moses, M., Recursive properties of isomorphism types, Ph.D. Thesis, Monash University, Clayton, Victoria, Australia, 1983.Google Scholar
[4] Moses, M., Relations intrinsically recursive in linear orders, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 32 (1986), pp. 467–472.CrossRefGoogle Scholar
[5] Moses, M., Recursive linear orders with recursive successivities, Annals of Pure and Applied Logic, vol. 27 (1984), pp. 253–264.CrossRefGoogle Scholar
[6] Remmel, J. B., Recursively categorical linear orders, Proceedings of the American Mathematical Society, vol. 83 (1981), pp. 379–386.Google Scholar
[7] Roy, D. K. and Watnick, R., Finite condensations of recursive linear orders, Annals of Pure and Applied Logic (to appear).Google Scholar
[8] Rosenstein, J. G., Linear orderings, Academic Press, New York, 1982.Google Scholar
[9] Watnick, R., A generalization of Tennenbaum's theorem of effectively finite recursive linear orderings, this Journal, vol. 49 (1984), pp. 563–569.Google Scholar