A coding of the countable linear orderings

Studia Logica 49 (4):585 - 590 (1990)
  Copy   BIBTEX

Abstract

Associate to any linear ordering on the integers the mapping whose value on n is the cardinality of {kn; kn}: a purely combinatorial characterization for the mappings associated to the well-orderings is established.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

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

A recursion principle for linear orderings.Juha Oikkonen - 1992 - Journal of Symbolic Logic 57 (1):82-96.
Up to Equimorphism, Hyperarithmetic Is Recursive.Antonio Montalbán - 2005 - Journal of Symbolic Logic 70 (2):360 - 378.
Elementary embedding between countable Boolean algebras.Robert Bonnet & Matatyahu Rubin - 1991 - Journal of Symbolic Logic 56 (4):1212-1229.
Some dichotomy theorems for isomorphism relations of countable models.Su Gao - 2001 - Journal of Symbolic Logic 66 (2):902-922.
A construction for recursive linear orderings.C. J. Ash - 1991 - Journal of Symbolic Logic 56 (2):673-683.

Analytics

Added to PP
2009-01-28

Downloads
28 (#490,379)

6 months
1 (#1,042,085)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Patrick Dehornoy
Université de Caen

Citations of this work

No citations found.

Add more citations

References found in this work

"[Product]"¹1-complete families of elementary sequences.Patrick Dehornoy - 1988 - Annals of Pure and Applied Logic 38 (3):257.

Add more references