Journal of Symbolic Logic

A Construction for Recursive Linear Orderings

C. J. Ash

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

Abstract

We 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 $\triangle^0_{2\beta + 1}$ linear ordering of type $\tau$, then there is a recursive ordering of type $\omega^\beta \cdot \tau$.

Article information

Source
J. Symbolic Logic, Volume 56, Issue 2 (1991), 673-683.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183743666

Mathematical Reviews number (MathSciNet)
MR1133094

Zentralblatt MATH identifier
0742.03013

JSTOR
links.jstor.org

Subjects
Primary: 03d45
Secondary: 03C57: Effective and recursion-theoretic model theory [See also 03D45] 03C75: Other infinitary logic

Citation

Ash, C. J. A Construction for Recursive Linear Orderings. J. Symbolic Logic 56 (1991), no. 2, 673--683. https://projecteuclid.org/euclid.jsl/1183743666


Export citation