A construction for recursive linear orderings

Journal of Symbolic Logic 56 (2):673-683 (1991)
  Copy   BIBTEX

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 ▵ 0 2β + 1 linear ordering of type τ, then there is a recursive ordering of type ω β · τ

Categories

Keywords

Reprint years

DOI

10.2307/2274709

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Using d-separation to calculate zero partial correlations in linear models with correlated errors.Peter Spirtes, Thomas Richardson, Christopher Meek, Richard Scheines & Clark Glymour - unknown
A recursion principle for linear orderings.Juha Oikkonen - 1992 - Journal of Symbolic Logic 57 (1):82-96.
A coding of the countable linear orderings.Patrick Dehornoy - 1990 - Studia Logica 49 (4):585 - 590.
Finite condensations of recursive linear orders.Dev K. Roy & Richard Watnick - 1988 - Studia Logica 47 (4):311 - 317.
A generalization of tennenbaum's theorem on effectively finite recursive linear orderings.Richard Watnick - 1984 - Journal of Symbolic Logic 49 (2):563-569.
Recursive linear orderings and hyperarithmetical functions.Shih-Chao Liu - 1962 - Notre Dame Journal of Formal Logic 3 (3):129-132.
On Ehrenfeucht-fraïssé equivalence of linear orderings.Juha Oikkonen - 1990 - Journal of Symbolic Logic 55 (1):65-73.
Accessible recursive functions.Stanley S. Wainer - 1999 - Bulletin of Symbolic Logic 5 (3):367-388.
Up to Equimorphism, Hyperarithmetic Is Recursive.Antonio Montalbán - 2005 - Journal of Symbolic Logic 70 (2):360 - 378.

Analytics

Added to PP
2009-01-28

Downloads
30 (#519,519)

6 months
8 (#342,364)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Indecomposable linear orderings and hyperarithmetic analysis.Antonio Montalbán - 2006 - Journal of Mathematical Logic 6 (1):89-120.
Recursive and r.e. quotient Boolean algebras.John J. Thurber - 1994 - Archive for Mathematical Logic 33 (2):121-129.

View all 8 citations / Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Pairs of recursive structures.C. J. Ash & J. F. Knight - 1990 - Annals of Pure and Applied Logic 46 (3):211-234.
Labelling systems and R.E. structures.C. J. Ash - 1990 - Annals of Pure and Applied Logic 47 (2):99-119.

Add more references