Skip to main content Accessibility help
×
Home
Hostname: page-component-78dcdb465f-nbrzn Total loading time: 0.307 Render date: 2021-04-17T21:36:43.654Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false, "newCitedByModal": true }

Splittings of effectively speedable sets and effectively levelable sets

Published online by Cambridge University Press:  12 March 2014

Roland SH. Omanadze
Affiliation:
I. Vekua Institute of Applied Mathematics, Tbilisi State University, Tbilisi, 0143, Georgia, E-mail: omanr@viam.hepi.edu.ge
Corresponding
E-mail address:

Abstract

We prove that a computably enumerable set A is effectively speedable (effectively levelable) if and only if there exists a splitting (A0, A1) of A such that both A0 and A1 are effectively speedable (effectively levelable). These results answer two questions raised by J. B. Remmel.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2004

Access options

Get access to the full version of this content by using one of the access options below.

References

[1]Bäuerle, F. A. and Remmel, J. B., On speedable and levelable vector spaces, Annals of Pure and Applied Logic, vol. 67 (1994), pp. 61112.CrossRefGoogle Scholar
[2]Blum, M., A machine-independent theory of the complexity of recursive functions, Journal of the Association for Compututing Machinery, vol. 14 (1967), pp. 322336.CrossRefGoogle Scholar
[3]Blum, M., On the size of machines, Information and Control, vol. 11 (1967), pp. 257265.CrossRefGoogle Scholar
[4]Blum, M. and Marques, I., On computational complexity of recursively enumerable sets, this Journal, vol. 38 (1973), pp. 579593.Google Scholar
[5]Downey, R. and Shore, R., Splitting theorems and the jump operator, this Journal, vol. 94 (1998), pp. 4552.Google Scholar
[6]Downey, R. and Stob, M., Splitting theorems in recursion theory, Annals of Pure and Applied Logic, vol. 65 (1993), pp. 1106.CrossRefGoogle Scholar
[7]Filotti, I., On effectively levelable sets, Recursive Function Theory Newsletter, vol. 2 (1972), pp. 1213.Google Scholar
[8]Friedberg, R. M. and Rogers, H. Jr., Reducibility and completeness for sets of integers, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 5 (1959), pp. 117125.CrossRefGoogle Scholar
[9]Gill, J. T. III and Morris, P. H., On subcreative sets and S-reducibility, this Journal, vol. 39 (1974), no. 4, pp. 669677.Google Scholar
[10]Jahn, M. A., Implicit measuraments of dynamic complexity properties and splittings of speedable sets, this Journal, vol. 64 (1999), no. 3, pp. 10331064.Google Scholar
[11]Odifreddi, P., Classical recursion theory, vol. I, North-Holland Publishing Co., Amsterdam, 1989.Google Scholar
[12]Omanadze, R. Sh., On sQ-completeness of recursively enumerable sets, Matematicheskie Zametki, vol. 52 (1992), pp. 7987, in Russian; Mathematical Notes, 1993, pp. 948–952 (English translation).Google Scholar
[13]Omanadze, R. Sh., Complexity properties of recursively enumerable sets and sQ-completeness, Matematicheskie Zametki, vol. 62 (1997), no. 3, pp. 425429, in Russian; Mathematical Notes, pp. 356–359 (English translation).Google Scholar
[14]Omanadze, R. Sh., Quasi-degrees of recursively enumerable sets, Computability and models: Perspectives east and west (Cooper, S. B. and Goncharov, S., editors), Kluwer Academic/Plenum Publishers, New York, Boston, Dordrecht, London, Moscow, 2003.Google Scholar
[15]Rogers, H. Jr., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.Google Scholar
[16]Soare, R. I., Computational complexity, speedable and levelable sets, this Journal, vol. 42 (1977), pp. 545563.Google Scholar
[17]Soare, R. I., Recursively enumerable sets and degrees, Perspectives in Mathematical Logic, Omega Series, Springer-Verlag, Heidelberg, 1987.CrossRefGoogle Scholar

Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 9 *
View data table for this chart

* Views captured on Cambridge Core between September 2016 - 17th April 2021. This data will be updated every 24 hours.

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@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 sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent 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.

Splittings of effectively speedable sets and effectively levelable sets
Available formats
×

Send article to Dropbox

To send 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 use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

Splittings of effectively speedable sets and effectively levelable sets
Available formats
×

Send article to Google Drive

To send 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 use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

Splittings of effectively speedable sets and effectively levelable sets
Available formats
×
×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *