Abstract
Associate to any linear ordering ⊲ on the integers the mapping whose value on n is the cardinality of {k<n; k⊲n}: a purely combinatorial characterization for the mappings associated to the well-orderings is established.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Dehornoy, Π l -complete families of elementary sequences, Annals of Pure and Applied Logic, 38 (1988), pp. 257–287.
P. Dehornoy, Turing complexity of the ordinals, Information Processing Letters, 23 (1986), pp. 167–170.
P. Dehornoy, Algebraic properties of the shift mapping, Proc. of the AMS, 106. 3 (1989), pp. 617–623.
A. Denjoy, L'énumération transfinie, Gauthiers-Villars, 1942.
A. Kechris, Homogeneous trees and projective scales, in Cabal Seminar 77–79, Springer Lect. Notes in Math. 839, 1980.
I. Moschovakis, Descriptive Set Theory, North Holland, 1980.
Author information
Authors and Affiliations
Additional information
This work was partially supported by a CNRS grant PRC mathématiques and informatique.
Rights and permissions
About this article
Cite this article
Dehornoy, P. A coding of the countable linear orderings. Studia Logica 49, 585–590 (1990). https://doi.org/10.1007/BF00370167
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00370167