Relations Intrinsically Recursive in Linear Orders

Mathematical Logic Quarterly 32 (25‐30):467-472 (1986)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

Recursive linear orders with recursive successivities.Michael Moses - 1984 - Annals of Pure and Applied Logic 27 (3):253-264.
An Undecidable Linear Order That Is $n$-Decidable for All $n$.John Chisholm & Michael Moses - 1998 - Notre Dame Journal of Formal Logic 39 (4):519-526.
Computability theory and linear orders.Rod Downey - 1998 - In I͡Uriĭ Leonidovich Ershov (ed.), Handbook of Recursive Mathematics. Elsevier. pp. 138--823.
A construction for recursive linear orderings.C. J. Ash - 1991 - Journal of Symbolic Logic 56 (2):673-683.
Up to Equimorphism, Hyperarithmetic Is Recursive.Antonio Montalbán - 2005 - Journal of Symbolic Logic 70 (2):360 - 378.
The Block Relation in Computable Linear Orders.Michael Moses - 2011 - Notre Dame Journal of Formal Logic 52 (3):289-305.
Decidable discrete linear orders.M. Moses - 1988 - Journal of Symbolic Logic 53 (2):531-539.
Complexity and Relations.Jeanette Elizabeth Lancaster - 2013 - Educational Philosophy and Theory 45 (12):1264-1275.
Coloring linear orders with Rado's partial order.Riccardo Camerlo & Alberto Marcone - 2007 - Mathematical Logic Quarterly 53 (3):301-305.

Analytics

Added to PP
2013-12-01

Downloads
8 (#1,283,306)

6 months
4 (#818,853)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Recursive linear orders with recursive successivities.Michael Moses - 1984 - Annals of Pure and Applied Logic 27 (3):253-264.

Add more references