Linear orderings under one-one reducibility

Journal of Symbolic Logic 31 (1):70-85 (1966)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270621

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,283

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

The metamathematics of scattered linear orderings.P. Clote - 1989 - Archive for Mathematical Logic 29 (1):9-20.
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.
A recursion principle for linear orderings.Juha Oikkonen - 1992 - Journal of Symbolic Logic 57 (1):82-96.
Countably categorical coloured linear orders.Feresiano Mwesigye & John K. Truss - 2010 - Mathematical Logic Quarterly 56 (2):159-163.
On Computable Self-Embeddings of Computable Linear Orderings.Rodney G. Downey, Bart Kastermans & Steffen Lempp - 2009 - Journal of Symbolic Logic 74 (4):1352 - 1366.
A coding of the countable linear orderings.Patrick Dehornoy - 1990 - Studia Logica 49 (4):585 - 590.
A construction for recursive linear orderings.C. J. Ash - 1991 - Journal of Symbolic Logic 56 (2):673-683.
Equivalence between Fraïssé’s conjecture and Jullien’s theorem.Antonio Montalbán - 2006 - Annals of Pure and Applied Logic 139 (1):1-42.
Δ20-categoricity in Boolean algebras and linear orderings.Charles F. D. McCoy - 2003 - Annals of Pure and Applied Logic 119 (1-3):85-120.
Cognitive processing of linear orderings.Karl W. Scholz & George R. Potts - 1974 - Journal of Experimental Psychology 102 (2):323.
Up to Equimorphism, Hyperarithmetic Is Recursive.Antonio Montalbán - 2005 - Journal of Symbolic Logic 70 (2):360 - 378.
Coloring linear orders with Rado's partial order.Riccardo Camerlo & Alberto Marcone - 2007 - Mathematical Logic Quarterly 53 (3):301-305.
On the equimorphism types of linear orderings.Antonio Montalbán - 2007 - Bulletin of Symbolic Logic 13 (1):71-99.
Degree spectra of the successor relation of computable linear orderings.Jennifer Chubb, Andrey Frolov & Valentina Harizanov - 2009 - Archive for Mathematical Logic 48 (1):7-13.
Reducibility orderings: Theories, definability and automorphisms.Anil Nerode & Richard A. Shore - 1980 - Annals of Mathematical Logic 18 (1):61-89.

Analytics

Added to PP
2009-01-28

Downloads
40 (#400,484)

6 months
5 (#648,432)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

System Functions and Their Decision Problems.M. B. Thuraisingham - 1984 - Mathematical Logic Quarterly 30 (7-8):119-128.
On the Simplicity of Busy Beaver Sets.Robert P. Daley - 1978 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24 (13-14):207-224.
System functions and their decision problems.M. B. Thuraisingham - 1984 - Mathematical Logic Quarterly 30 (7‐8):119-128.

Add more citations

References found in this work

No references found.

Add more references