Hostname: page-component-6898cfcb55-zsp5v Total loading time: 0 Render date: 2026-11-12T01:36:55.998Z Has data issue: false hasContentIssue false
  • English
  • Français

A construction for recursive linear orderings

Published online by Cambridge University Press:  12 March 2014

C. J. Ash
C. J. Ash*
Affiliation:
Department of Mathematics, Monash University, Clayton, Victoria 3168, Australia
Get accessRights & Permissions [Opens in a new window]

Abstract

We re-express a previous general result in a way which seems easier to remember, using the terminology of infinite games. We show how this can be applied to construct recursive linear orderings, showing, for example, that if there is a linear ordering of type τ, then there is a recursive ordering of type ωβ · τ.

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 56 , Issue 2 , June 1991, pp. 673 - 683
Copyright
Copyright © Association for Symbolic Logic 1991

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

Article purchase

Temporarily unavailable

References

REFERENCES

[1]Ash, C. J., Recursive labelling systems and stability of recursive structures in hyperarithmetical degrees, Transactions of the American Mathematical Society, vol. 298 (1986), pp. 497–514.CrossRefGoogle Scholar
[2]Ash, C. J., Labelling systems and r.e. structures, Annals of Pure and Applied Logic, vol. 47 (1990), pp. 99–119.CrossRefGoogle Scholar
[3]Ash, C. J. and Knight, J. F., Pairs of recursive structures, Annals of Pure and Applied Logic, vol. 46 (1990), pp. 211–234.CrossRefGoogle Scholar
[4]Ash, C. J., Jockusch, C. G., and Knight, J. F., Jumps of orderings, Transactions of the American Mathematical Society, vol. 319 (1990), pp. 573–599.CrossRefGoogle Scholar
[5]Love, J., M.Sc. thesis, Monash University, Clayton, Victoria, Australia.Google Scholar
[6]Rogers, H., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.Google Scholar