Translator Disclaimer
March 2004 Splittings of effectively speedable sets and effectively levelable sets
Roland Sh. Omanadze
J. Symbolic Logic 69(1): 143-158 (March 2004). DOI: 10.2178/jsl/1080938833

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.

Citation

Download Citation

Roland Sh. Omanadze. "Splittings of effectively speedable sets and effectively levelable sets." J. Symbolic Logic 69 (1) 143 - 158, March 2004. https://doi.org/10.2178/jsl/1080938833

Information

Published: March 2004
First available in Project Euclid: 2 April 2004

zbMATH: 1088.03038
MathSciNet: MR2039353
Digital Object Identifier: 10.2178/jsl/1080938833

Rights: Copyright © 2004 Association for Symbolic Logic

JOURNAL ARTICLE
16 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.69 • No. 1 • March 2004
Back to Top