Skip to main content Accessibility help
×
Home
Hostname: page-component-55597f9d44-54jdg Total loading time: 0.221 Render date: 2022-08-11T13:49:11.031Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true } hasContentIssue true

Bounding non-GL2 and R.E.A.

Published online by Cambridge University Press:  12 March 2014

Klaus Ambos-Spies
Affiliation:
Institut für Informatik, University of Heidelberg, Im Neuenheimer Feld 294, 69120 Heidelberg, Germany, E-mail: ambos@math.uni-heidelberg.de
Decheng Ding
Affiliation:
Department of Mathematics, Nanjing University, 22 Hankou Road, Nanjing 210093, P.R., China, E-mail: dcding@nju.edu.cn
Wei Wang*
Affiliation:
Department of Mathematics, Nanjing University, 22 Hankou Road, Nanjing 210093, P.R., China, E-mail: wwang.cn@gmail.com
Liang Yu
Affiliation:
Department of Mathematics, Nanjing University, 22 Hankou Road, Nanjing 210093, P.R., China, E-mail: yuliang.nju@gmail.com
*
Department of Mathematics, National University of Singapore, 2 Science Drive 2, Singapore 117543, Singapore

Abstract

We prove that every Turing degree a bounding some non-GL2 degree is recursively enumerable in and above (r.e.a.) some 1-generic degree.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Harizanov, Valentina S., Turing degrees of certain isomorphic images of computable relations, Ann. Pure Appl. Logic, vol. 93 (1998), no. 1-3, pp. 103113.CrossRefGoogle Scholar
[2]Hirschfeldt, Denis R. and Shore, Richard A., Combinatorial principles weaker than Ramsey's theorem for pairs, this Journal, vol. 72 (2007), no. 1, pp. 171206.Google Scholar
[3]Jockusch, Carl G. Jr, Degrees of generic sets, Recursion theory: Its generalizations and applications. Proceedings of Logic Colloquium '79, Leeds, August 1979 (Cambridge, U. K.) (Drake, F. R. and Wainer, S. S., editors), Cambridge University Press, 1980, pp. 110139.Google Scholar
[4]Jockusch, Carl G. Jr. and Posner, David B., Double jumps of minimal degrees, this Journal, vol. 43 (1978), no. 4, pp. 715724.Google Scholar
[5]Kumabe, Masahiro, Relative recursive enumerability of generic degrees, this Journal, vol. 56 (1991), no. 3, pp. 10751084.Google Scholar
[6]Kumabe, Masahiro, A 1-generic degree with a strong minimal cover, this Journal, vol. 65 (2000), no. 3, pp. 13951442.Google Scholar
[7]Lerman, M., Degrees of unsolvability, Perspectives in Mathematical Logic, Springer-Verlag, Heidelberg, 1983, 307 pages.CrossRefGoogle Scholar
[8]Martin, D. A., Classes of recursively enumerable sets and degrees of unsolvability, Z. Math. Logik Grundlag. Math., vol. 12 (1966), pp. 295310.CrossRefGoogle Scholar
[9]Robinson, R. W., Jump restricted interpolation in the recursively enumerable degrees, Ann. of Math. (2), vol. 93 (1971), pp. 586596.CrossRefGoogle Scholar
[10]Sasso, L. P., A minimal degree not realizing least possible jump, this Journal, vol. 39 (1974), pp. 571574.Google Scholar
[11]Soare, Robert I., Recursively enumerable sets and degrees, Perspectives in Mathematical Logic, Springer–Verlag, Heidelberg, 1987.CrossRefGoogle Scholar
[12]Yu, Liang, Lowness for genericity, Arch. Math. Logic, vol. 45 (2006), no. 2, pp. 233238.CrossRefGoogle Scholar
4
Cited by

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Bounding non-GL2 and R.E.A.
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

Bounding non-GL2 and R.E.A.
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

Bounding non-GL2 and R.E.A.
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *