A construction for recursive linear orderings

Abstract

AbstractWe re-express a previous general result in a way which seems easier to remember, using the terminology of infinite games. We show how this can be applied to construct recursive linear orderings, showing, for example, that if there is a linear ordering of type τ, then there is a recursive ordering of type ωβ · τ.