Skip to main content
SpringerLink
Log in

Finite condensations of recursive linear orders

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

The complexity of aII 4 set of natural numbers is encoded into a linear order to show that the finite condensation of a recursive linear order can beII 2–II 1. A priority argument establishes the same result, and is extended to a complete classification of finite condensations iterated finitely many times.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. G. Rosenstein,Linear Orderings, Academic Press, New York, 1982.

    Google Scholar 

  2. D. K. Roy,R.e. presented linear orders,Journal of Symbolic Logic 48 (1983), pp. 369–376.

    Google Scholar 

  3. D. K. Roy,Linear order types of nonrecursive presentability,Zeitschrift für mathematische Logik und Grundlagen der Matematik 31 (1985), pp. 495–501.

    Google Scholar 

  4. R. Watnick,A generalization of Tennenbaum's theorem,Journal of Symbolic Logic 49 (1984), pp. 563–569.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Florida International University, 33199, Miami, Florida, USA

    Dev K. Roy & Richard Watnick

  2. Department of Mathematics, University of Connecticut, 06903, Stamford, Connecticut, USA

    Dev K. Roy & Richard Watnick

Authors
  1. Dev K. Roy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Richard Watnick
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Roy, D.K., Watnick, R. Finite condensations of recursive linear orders. Stud Logica 47, 311–317 (1988). https://doi.org/10.1007/BF00671562

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00671562

Keywords

Search

Navigation