A coding of the countable linear orderings

Studia Logica 49 (4):585 - 590 (1990)
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.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 9,360
External links
  • Through your library Configure
    References found in this work BETA
    Patrick Dehornoy (1988). Φ11-Complete Families of Elementary Sequences. Annals of Pure and Applied Logic 38 (3):257-287.
    Citations of this work BETA

    No citations found.

    Similar books and articles

    Monthly downloads

    Sorry, there are not enough data points to plot this chart.

    Added to index


    Total downloads


    Recent downloads (6 months)


    How can I increase my downloads?

    My notes
    Sign in to use this feature

    Start a new thread
    There  are no threads in this forum
    Nothing in this forum yet.