A construction for recursive linear orderings

Journal of Symbolic Logic 56 (2):673-683 (1991)
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 ▵ 0 2β + 1 linear ordering of type τ, then there is a recursive ordering of type ω β · τ
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2274709
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 23,189
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
C. J. Ash & J. F. Knight (1990). Pairs of Recursive Structures. Annals of Pure and Applied Logic 46 (3):211-234.
C. J. Ash (1990). Labelling Systems and R.E. Structures. Annals of Pure and Applied Logic 47 (2):99-119.

Add more references

Citations of this work BETA
Kevin J. Davey (1994). Inseparability in Recursive Copies. Annals of Pure and Applied Logic 68 (1):1-52.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

5 ( #583,599 of 1,940,952 )

Recent downloads (6 months)

1 ( #457,800 of 1,940,952 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.