Skip to main content
Log in

Restrictions on the degree spectra of algebraic structures

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

Abstract

We construct the degree b ≤ 0″ admitting no algebraic structure with degree spectrum {x: x ≰ b}. Moreover, we solve Miller’s problem of distinguishing incomparable degrees by the spectra of linear orderings.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Knight J. F., “Degrees coded in jumps of orderings,” J. Symbolic Logic, 51, No. 4, 1034–1042 (1986).

    Article  MATH  MathSciNet  Google Scholar 

  2. Richter L. J., “Degrees of structures,” J. Symbolic Logic, 46, No. 4, 723–731 (1981).

    Article  MATH  MathSciNet  Google Scholar 

  3. Slaman T. A., “Relative to any nonrecursive set,” Proc. Amer. Math. Soc., 126, No. 7, 2117–2122 (1998).

    Article  MATH  MathSciNet  Google Scholar 

  4. Wehner S., “Enumerations, countable structures, and Turing degrees,” Proc. Amer. Math. Soc., 126, No. 7, 2131–2139 (1998).

    Article  MATH  MathSciNet  Google Scholar 

  5. Miller R. G., “The Δ 02 -spectrum of a linear order,” J. Symbolic Logic, 66, No. 2, 470–486 (2001).

    Article  MATH  MathSciNet  Google Scholar 

  6. Downey R., “On presentations of algebraic structures,” in: Complexity, Logic, and Recursion Theory, Dekker, New York, 1997, pp. 157–205.

    Google Scholar 

  7. Soskov I. N., “Degree spectra and co-spectra of structures,” Ann. Univ. Sofia, 96, 45–68 (2003).

    MathSciNet  Google Scholar 

  8. Hirschfeldt D. R., Khoussainov B., Shore R. A., and Slinko A. M., “Degree spectra and computable dimensions in algebraic structures,” Ann. Pure Appl. Logic, 115, 71–113 (2002).

    Article  MATH  MathSciNet  Google Scholar 

  9. Harizanov V. S. and Miller R. G., “Spectra of structures and relations,” J. Symbolic Logic, 72, 324–348 (2007).

    Article  MATH  MathSciNet  Google Scholar 

  10. Goncharov S. S., Harizanov V. S., Knight J. F., McCoy C., Miller R. G., and Solomon R., “Enumerations in computable structure theory,” Ann. Pure Appl. Logic, 136, 219–246 (2005).

    Article  MATH  MathSciNet  Google Scholar 

  11. Kalimullin I. Sh., “Spectra of degrees of some algebraic structures,” Algebra and Logic, 46, No. 6, 399–408 (2007).

    Article  MathSciNet  Google Scholar 

  12. Soare R. I., Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets, Springer-Verlag, Berlin; Heidelberg; New York; London; Paris; Tokyo (1987).

    Google Scholar 

  13. McEvoy K. and Cooper S. B., “On minimal pairs of enumeration degrees,” J. Symbolic Logic, 50, No. 4, 983–1001 (1985).

    Article  MATH  MathSciNet  Google Scholar 

  14. Sorbi A., “The enumeration degrees of Σ 02 sets,” in: Complexity, Logic, and Recursion Theory, Dekker, New York, 1997, pp. 303–330.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to I. Sh. Kalimullin.

Additional information

Original Russian Text Copyright © 2008 Kalimullin I. Sh.

The author was supported by the Russian Foundation for Basic Research (Grant 05-01-00605) and the President of the Russian Federation (Grant MK-4314.2008.1).

__________

Kazan’. Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 49, No. 6, pp. 1296–1309, November–December, 2008.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kalimullin, I.S. Restrictions on the degree spectra of algebraic structures. Sib Math J 49, 1034–1043 (2008). https://doi.org/10.1007/s11202-008-0099-4

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11202-008-0099-4

Keywords

Navigation