Every recursive linear ordering has a copy in dtime-space (n, log(n))

Journal of Symbolic Logic 55 (1):260-276 (1990)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2274966

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 103,703

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

Every recursive linear ordering has a copy in DTIMESPACE (n; log (n)).S. Gregorie - 1990 - Journal of Symbolic Logic 55:260-276.
On Computable Self-Embeddings of Computable Linear Orderings.Rodney G. Downey, Bart Kastermans & Steffen Lempp - 2009 - Journal of Symbolic Logic 74 (4):1352 - 1366.
Up to Equimorphism, Hyperarithmetic Is Recursive.Antonio Montalbán - 2005 - Journal of Symbolic Logic 70 (2):360 - 378.
Degrees of orderings not isomorphic to recursive linear orderings.Carl G. Jockusch & Robert I. Soare - 1991 - Annals of Pure and Applied Logic 52 (1-2):39-64.
Recursive linear orders with recursive successivities.Michael Moses - 1984 - Annals of Pure and Applied Logic 27 (3):253-264.
Serge Grigorieff. Combinatorics on ideals and forcing. Annals of mathematical logic, vol. 3 no. 4 , pp. 363–394.David Booth - 1973 - Journal of Symbolic Logic 38 (3):528-529.
Computable choice functions for computable linear orderings.Manuel Lerman & Richard Watnick - 2003 - Mathematical Logic Quarterly 49 (5):485-510.
Review: John N. Crossley, Recursive equivalence: A survey; John N. Crossley, Recursive equivalence. [REVIEW]Alfred B. Manaster - 1972 - Journal of Symbolic Logic 37 (2):406-407.
The complexity of squares in the group of isometries of the Baire space.Aaron Hill - 2012 - Journal of Symbolic Logic 77 (1):329-336.

Analytics

Added to PP
2009-01-28

Downloads
240 (#113,952)

6 months
9 (#409,698)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Polynomial-time abelian groups.Douglas Cenzer & Jeffrey Remmel - 1992 - Annals of Pure and Applied Logic 56 (1-3):313-363.
Polynomial-time versus recursive models.Douglas Cenzer & Jeffrey Remmel - 1991 - Annals of Pure and Applied Logic 54 (1):17-58.
Space complexity of Abelian groups.Douglas Cenzer, Rodney G. Downey, Jeffrey B. Remmel & Zia Uddin - 2009 - Archive for Mathematical Logic 48 (1):115-140.

View all 9 citations / Add more citations

References found in this work

Recursive linear orders with recursive successivities.Michael Moses - 1984 - Annals of Pure and Applied Logic 27 (3):253-264.
Linear Orderings.Joseph G. Rosenstein - 1983 - Journal of Symbolic Logic 48 (4):1207-1209.
Computational Complexity.K. Wagner & G. Wechsung - 1989 - Journal of Symbolic Logic 54 (2):622-624.

Add more references