Splittings of effectively speedable sets and effectively levelable sets

DOI10.2178/JSL/1080938833MaRDI QIDQ5311714zbMATH OpenOpenAlexFDO

Authors 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

computably enumerable setspeedable setsplitting

Mathematics Subject Classification ID

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

Recommendations

• Implicit measurements of dynamic complexity properties and splittings of speedable sets
• Splitting theorems and the jump operator
• scientific article; zbMATH DE number 4023250
• Some reducibilities and splittings of recursively enumerable sets
• On splits of computably enumerable sets

Cites work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• Computability and models. Perspectives east and west
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• On speedable and levelable vector spaces
• On the size of machines
• Reducibility and Completeness for Sets of Integers
• Splitting theorems and the jump operator
• Splitting theorems in recursion theory

Cited in

(2)

• scientific article; zbMATH DE number 123920 (Why is no real title available?)
• Implicit measurements of dynamic complexity properties and splittings of speedable sets

This page was built for publication: Splittings of effectively speedable sets and effectively levelable sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311714)