Skip to main content
SpringerLink
Log in

Computability on linear orderings enriched with predicates

  • Published:
Algebra and Logic Aims and scope

Let L be a quasidiscrete linear ordering. We specify some conditions for the existence of a computable presentation for L or for the structure (L, adj), where adj(x, y) is a predicate distinguishing adjacent elements.

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. R. G. Downey and C. G. Jockush, “Every low Boolean algebra is isomorphic to a recursive one,” Proc. Am. Math. Soc., 122, No. 3, 871–880 (1994).

    Article  MATH  Google Scholar 

  2. J. J. Thurber, “Every low 2 Boolean algebra has a recursive copy,” Proc. Am. Math. Soc., 123, No. 12, 3859–3866 (1995).

    Article  MATH  MathSciNet  Google Scholar 

  3. J. F. Knight and M. Stob, “Computable Boolean algebras,” J. Symb. Log., 65, No. 4, 1605–1623 (2000).

    Article  MATH  MathSciNet  Google Scholar 

  4. A. N. Frolov, “Δ 02 -copies of linear orderings,” Algebra Logika, 45, No. 3, 354–370 (2006).

    MATH  MathSciNet  Google Scholar 

  5. L. Feiner, “Hierarchies of Boolean algebras,” J. Symb. Log., 35, No. 3, 365–374 (1971).

    Article  MathSciNet  Google Scholar 

  6. R. Watnick, “A generalization of Tennenbaum’s theorem on effectively finite recursive linear orderings,” J. Symb. Log., 49, No. 2, 563–569 (1984).

    Article  MATH  MathSciNet  Google Scholar 

  7. C. J. Ash, C. Jockusch, and J. F. Knight, “Jumps of orderings,” Trans. Am. Math. Soc., 319, No. 2, 573–599 (1990).

    Article  MATH  MathSciNet  Google Scholar 

  8. C. J. Ash, “A construction for recursive linear orderings,” J. Symb. Log., 56, No. 2, 673–683 (1991).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, pr. Akad. Koptyuga 4, Novosibirsk, 630090, Russia

    P. E. Alaev

  2. Novosibirsk State University, ul. Pirogova 2, Novosibirsk, 630090, Russia

    P. E. Alaev

  3. Eastern Oregon University, One University Boulevard, La Grande, OR, 97850, USA

    J. Thurber

  4. Chebotarev Institute of Mathematics and Mechanics, Kazan State University, ul. Prof. Nuzhina 17, Kazan, 420008, Russia

    A. N. Frolov

Authors
  1. P. E. Alaev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Thurber
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. N. Frolov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to P. E. Alaev.

Additional information

Translated from Algebra i Logika, Vol. 48, No. 5, pp. 549–563, September–October, 2009.

Supported by RFBR (project No. 08-01-00336), by the Grants Council (under RF President) for State Aid of Leading Scientific Schools (grant NSh-335.2008.1), and by the Grants Council (under RF President) for State Aid of Young Doctors of Science (project MD-3377.2008.1).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alaev, P.E., Thurber, J. & Frolov, A.N. Computability on linear orderings enriched with predicates. Algebra Logic 48, 313–320 (2009). https://doi.org/10.1007/s10469-009-9067-8

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10469-009-9067-8

Keywords

Search

Navigation