Splittings of effectively speedable sets and effectively levelable sets

DOI10.2178/jsl/1080938833zbMath1088.03038OpenAlexW2122943507MaRDI QIDQ5311714

Roland Sh. Omanadze

Publication date: 29 August 2005

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1080938833

zbMATH Keywords

splittingcomputably enumerable setspeedable set

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Cites Work

• Unnamed Item
• Unnamed Item
• Splitting theorems and the jump operator
• Splitting theorems in recursion theory
• On speedable and levelable vector spaces
• Reducibility and Completeness for Sets of Integers
• A Machine-Independent Theory of the Complexity of Recursive Functions
• On the size of machines