June 2011 A random set which only computes strongly jump-traceable c.e. sets
Noam Greenberg
J. Symbolic Logic 76(2): 700-718 (June 2011). DOI: 10.2178/jsl/1305810771

Abstract

We prove that there is a Δ₂⁰, 1-random set Y such that every computably enumerable set which is computable from Y is strongly jump-traceable.

We also show that for every order function h there is an ω-c.e. random set Y such that every computably enumerable set which is computable from Y is h-jump-traceable. This establishes a correspondence between rates of jump-traceability and computability from ω-c.e. random sets.

Citation

Download Citation

Noam Greenberg. "A random set which only computes strongly jump-traceable c.e. sets." J. Symbolic Logic 76 (2) 700 - 718, June 2011. https://doi.org/10.2178/jsl/1305810771

Information

Published: June 2011
First available in Project Euclid: 19 May 2011

zbMATH: 1220.03042
MathSciNet: MR2830423
Digital Object Identifier: 10.2178/jsl/1305810771

Rights: Copyright © 2011 Association for Symbolic Logic

JOURNAL ARTICLE
19 PAGES

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

Vol.76 • No. 2 • June 2011
Back to Top