Journal of Symbolic Logic

Anti-complex sets and reducibilities with tiny use

Johanna N. Y. Franklin, Noam Greenberg, Frank Stephan, and Guohua Wu

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


In contrast with the notion of complexity, a set $A$ is called anti-complex if the Kolmogorov complexity of the initial segments of $A$ chosen by a recursive function is always bounded by the identity function. We show that, as for complexity, the natural arena for examining anti-complexity is the weak-truth table degrees. In this context, we show the equivalence of anti-complexity and other lowness notions such as r.e. traceability or being weak truth-table reducible to a Schnorr trivial set. A set $A$ is anti-complex if and only if it is reducible to another set $B$ with tiny use, whereby we mean that the use function for reducing $A$ to $B$ can be made to grow arbitrarily slowly, as gauged by unbounded nondecreasing recursive functions. This notion of reducibility is then studied in its own right, and we also investigate its range and the range of its uniform counterpart.

Article information

J. Symbolic Logic, Volume 78, Issue 4 (2013), 1307-1327.

First available in Project Euclid: 5 January 2014

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier


Franklin, Johanna N. Y.; Greenberg, Noam; Stephan, Frank; Wu, Guohua. Anti-complex sets and reducibilities with tiny use. J. Symbolic Logic 78 (2013), no. 4, 1307--1327. doi:10.2178/jsl.7804170.

Export citation