Keywords
- Linear Ordering
- Finite Interval
- Interval Maximization
- Turing Degree
- Expansion Step
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Fellner, S., Recursiveness and finite axiomatizability of linear orderings, Ph.D. Thesis, Rutgers Univ., 1976.
Rosenstein, J., Linear Orderings, Academic Press (to appear).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1981 Springer-Verlag
About this paper
Cite this paper
Lerman, M. (1981). On recursive linear orderings. In: Lerman, M., Schmerl, J.H., Soare, R.I. (eds) Logic Year 1979–80. Lecture Notes in Mathematics, vol 859. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0090945
Download citation
DOI: https://doi.org/10.1007/BFb0090945
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10708-8
Online ISBN: 978-3-540-38673-5
eBook Packages: Springer Book Archive
