Skip to main content
Springer Nature Link
Log in

Linear orders with distinguished function symbol

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

We consider certain linear orders with a function on them, and discuss for which types of functions the resulting structure is or is not computably categorical. Particularly, we consider computable copies of the rationals with a fixed-point free automorphism, and also ω with a non-decreasing function.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

References

  1. Calvert W., Cenzer D., Harizanov V., Morozov A.: Effective categoricity of equivalence structures. Ann. Pure Appl. Logic 141, 61–78 (2005)

    Article  MathSciNet  Google Scholar 

  2. Cholak P., Goncharov S., Khoussainov B., Shore R.A.: Computably categorical structures and expansions by constants. J. Symbol. Logic 64(1), 13–37 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  3. Dzgoev V.D., Goncharov S.S.: Autostability of models. Algebra i Logika 19, 45–58 (1980)

    MathSciNet  Google Scholar 

  4. Goncharov S.S.: The problem of the number of nonautoequivalent constructivizations. Algebra i Logika 19(6), 621–639, 745 (1980)

    MathSciNet  Google Scholar 

  5. Khusainov B.M.: The algorithmic dimension of unars. Algebra i Logika 27(4), 479–494, 499 (1988)

    MATH  MathSciNet  Google Scholar 

  6. Remmel J.B.: Recursively categorical linear orderings. Proc. Am. Math. Soc. 83, 387–391 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  7. Remmel J.B.: Recursively rigid Boolean algebras. Ann. Pure Appl. Logic 36(1), 39–52 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  8. Ventsov Yu.G.: Algorithmic properties of branching models. Algebra i Logika 25(4), 369–383, 494 (1986)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Florida, P.O. Box 118105, 358 Little Hall, Gainesville, FL, 32611, USA

    Douglas Cenzer

  2. Department of Pure Mathematics, University of Waterloo, Waterloo, ON, N2L 3G1, Canada

    Barbara F. Csima

  3. Department of Computer Science, University of Auckland, Auckland Private Bag, 92019, Auckland, New Zealand

    Bakhadyr Khoussainov

Authors
  1. Douglas Cenzer
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Barbara F. Csima
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Bakhadyr Khoussainov
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Douglas Cenzer.

Additional information

D. Cenzer was partially supported by National Science Foundation grants DMS 0532644 and 0554841 and 652372.

B. Csima was partially supported by Canadian NSERC Discovery Grant 312501.

B. Khoussainov has partially been supported by Marsden Fund of Royal New Zealand Society.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cenzer, D., Csima, B.F. & Khoussainov, B. Linear orders with distinguished function symbol. Arch. Math. Logic 48, 63–76 (2009). https://doi.org/10.1007/s00153-008-0112-4

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-008-0112-4

Mathematics Subject Classification (2000)