Skip to main content
×
Home

THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES

  • URI ANDREWS (a1), MINGZHONG CAI (a2), ISKANDER SH. KALIMULLIN (a3), STEFFEN LEMPP (a4), JOSEPH S. MILLER (a5) and ANTONIO MONTALBÁN (a6)...
Abstract
Abstract

We study Turing degrees a for which there is a countable structure ${\cal A}$ whose degree spectrum is the collection {x : xa}. In particular, for degrees a from the interval [0′, 0″], such a structure exists if a′ = 0″, and there are no such structures if a″ > 0‴.

Copyright
References
Hide All
[1] Cai M. and Shore R., Domination, forcing, array nonrecursiveness and relative recursive enumerability, this Journal, vol. 77 (2012), pp. 3348.
[2] Hirschfeldt D. R., Khoussainov B., Shore R. A., and Slinko A. M., Degree spectra and computable dimensions in algebraic structures . Annals of Pure and Applied Logic, vol. 115 (2002), no. 1–3, pp. 71113.
[3] Kalimullin I. S., Spectra of degrees of some structures . Algebra Logika, vol. 46 (2007), no. 6, pp. 729744.
[4] Kalimullin I. S., Almost computably enumerable families of sets . Sbornik: Mathematics, vol. 199 (2008), no. 10, pp. 14511458.
[5] Kalimullin I. S., Restrictions on the degree spectra of algebraic structures . Siberian Mathematical Journal, vol. 49 (2008), no. 6, pp. 10341043.
[6] Kalimullin I., Khoussainov B., and Melnikov A., Limitwise monotonic sequences and degree spectra of structures . Proceedings of the American Mathematical Society, vol. 141 (2013), pp. 32753289.
[7] Knight J. F., Degrees coded in jumps of orderings, this Journal, vol. 51 (1986), no. 4, pp. 10341042.
[8] Rogers H. Jr., Theory of Recursive Functions and Effective Computability, McGraw Hill, New York, 1968.
[9] de Leeuw K., Moore E. F., Shannon C. E., and Shapiro N., Computability by probabilistic machines , Automata Studies: Annals of Mathematics Studies, pp. 183212, no. 34, Princeton University Press, Princeton, N J, 1956.
[10] Miller R., The ${\rm{\Delta }}_2^0$ -spectrum of a linear order, this Journal, vol. 66 (2001), no. 2, pp. 470486.
[11] Robinson R. W., Interpolation and embedding in the recursively enumerable degrees . Annals of Mathematics, vol. 93 (1971), pp. 285314.
[12] Slaman T. A., Relative to any nonrecursive set . Proceedings of the American Mathematical Society, vol. 126 (1998), no. 7, pp. 21172122.
[13] Wehner S., Enumerations, countable structures and Turing degrees . Proceedings of the American Mathematical Society, vol. 126 (1998), no. 7, pp. 21312139.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords:

Metrics

Full text views

Total number of HTML views: 1
Total number of PDF views: 38 *
Loading metrics...

Abstract views

Total abstract views: 136 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 11th December 2017. This data will be updated every 24 hours.