Splittings of effectively speedable sets and effectively levelable sets

Journal of Symbolic Logic 69 (1):143-158 (2004)
  Copy   BIBTEX

Abstract

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

Categories

Keywords

Reprint years

DOI

10.2178/jsl/1080938833

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,709

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Can partial indexings be totalized?Dieter Spreen - 2001 - Journal of Symbolic Logic 66 (3):1157-1185.
Computational complexity, speedable and levelable sets.Robert I. Soare - 1977 - Journal of Symbolic Logic 42 (4):545-563.
Implicit measurements of dynamic complexity properties and splittings of speedable sets.Michael A. Jahn - 1999 - Journal of Symbolic Logic 64 (3):1037-1064.
On the relation provable equivalence and on partitions in effectively inseparable sets.Claudio Bernardi - 1981 - Studia Logica 40 (1):29 - 37.
On the construction of effectively random sets.Wolfgang Merkle & Nenad Mihailović - 2004 - Journal of Symbolic Logic 69 (3):862-878.
Effectively nowhere simple sets.D. Miller & J. B. Remmel - 1984 - Journal of Symbolic Logic 49 (1):129-136.
On effective topological spaces.Dieter Spreen - 1998 - Journal of Symbolic Logic 63 (1):185-221.
Simulations, learning and the metaverse: Changing cultures in legal education.Paul Maharg & Martin Owen - manuscript
On orbits, of prompt and low computably enumerable sets.Kevin Wald - 2002 - Journal of Symbolic Logic 67 (2):649-678.
On Subcreative Sets and S-Reducibility.John T. Gill Iii & Paul H. Morris - 1974 - Journal of Symbolic Logic 39 (4):669 - 677.

Analytics

Added to PP
2009-02-05

Downloads
25 (#630,077)

6 months
1 (#1,462,504)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Classical Recursion Theory.Peter G. Hinman - 2001 - Bulletin of Symbolic Logic 7 (1):71-73.
Reducibility and Completeness for Sets of Integers.Richard M. Friedberg & Hartley Rogers - 1959 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 5 (7-13):117-125.
Reducibility and Completeness for Sets of Integers.Richard M. Friedberg & Hartley Rogers - 1959 - Mathematical Logic Quarterly 5 (7‐13):117-125.
Splitting theorems in recursion theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.

View all 6 references / Add more references