Skip to main content Accessibility help
×
Home

Decomposition and infima in the computably enumerable degrees

  • Rodney G. Downey (a1), Geoffrey L. Laforte (a2) and Richard A. Shore (a3)

Abstract

Given two incomparable c.e. Turing degrees a and b, we show that there exists a c.e. degree c such that c = (ac) ∩ (bc), acbc, and c < ab.

Copyright

References

Hide All
[1]Ambos-Spies, K., On pairs of recursively enumerable degrees. Transactions of the American Mathematical Society, vol. 283 (1984), pp. 507531.
[2]Downey, R., The 0′′′ priority method with special attention to density results. Recursion theory week: Proceedings, Oberwolfach, 1989 (Ambos-Spies, K.et al., editors). Springer, Berlin, 1990.
[3]Fejer, P., The density of the nonbranching degrees. Annals of Pure and Applied Logic, vol. 24 (1983), pp. 113130.
[4]Kleene, S. C. and Post, E. L., The upper semi-lattice of degrees of recursive unsolvability, Annals of Mathematics, Second Series, vol. 59 (1954), pp. 370407.
[5]Lachlan, A., Lower bounds for pairs of recursively enumerable degrees, Proceedings of the London Mathematical Society, Third Series, vol. 16 (1966), pp. 537569.
[6]Lachlan, A., A recursively enumerable degree which will not split over all lesser ones, Annals of Mathematical Logic, vol. 9 (1975), pp. 307365.
[7]Lachlan, A., Decomposition of recursively enumerable degrees. Proceedings of the American Mathematical Society, vol. 79 (1980), pp. 629634.
[8]Sacks, G., On the degrees less than 0′, Annals of Mathematics, Second Series, vol. 77 (1963), pp. 211231.
[9]Sacks, G., The recursively enumerable degrees are dense. Annals of Mathematics, Second Series, vol. 80 (1964), pp. 300312.
[10]Shore, R. A., A noninversion theorem for the jump operator, Annals of Pure and Applied Logic, vol. 40 (1988), pp. 277303.
[11]Shore, R. A. and Slaman, T. A., Working below a low2 recursively enumerably degree, Archive for Mathematical Logic, vol. 29 (1990), pp. 201211.
[12]Slaman, T. A., The density of infima in the recursively enumerable degrees, Annals of Pure and Applied Logic, vol. 52 (1991), pp. 155179.
[13]Soare, R., Recursively enumerable sets and degrees, Springer-Verlag, Berlin, 1987.
[14]Spector, C., On degrees of recursive unsolvability, Annals of Mathematics, vol. 64 (1956), pp. 581592.
[15]Yates, C. E. M., A minimal pair of recursively enumerable degrees, this Journal, vol. 31 (1966), pp. 159168.

Related content

Powered by UNSILO

Decomposition and infima in the computably enumerable degrees

  • Rodney G. Downey (a1), Geoffrey L. Laforte (a2) and Richard A. Shore (a3)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.