Translator Disclaimer
June 2010 Schnorr trivial sets and truth-table reducibility
Johanna N. Y. Franklin, Frank Stephan
J. Symbolic Logic 75(2): 501-521 (June 2010). DOI: 10.2178/jsl/1268917492

Abstract

We give several characterizations of Schnorr trivial sets, including a new lowness notion for Schnorr triviality based on truth-table reducibility. These characterizations allow us to see not only that some natural classes of sets, including maximal sets, are composed entirely of Schnorr trivials, but also that the Schnorr trivial sets form an ideal in the truth-table degrees but not the weak truth-table degrees. This answers a question of Downey, Griffiths and LaForte.

Citation

Download Citation

Johanna N. Y. Franklin. Frank Stephan. "Schnorr trivial sets and truth-table reducibility." J. Symbolic Logic 75 (2) 501 - 521, June 2010. https://doi.org/10.2178/jsl/1268917492

Information

Published: June 2010
First available in Project Euclid: 18 March 2010

zbMATH: 1193.03073
MathSciNet: MR2648153
Digital Object Identifier: 10.2178/jsl/1268917492

Rights: Copyright © 2010 Association for Symbolic Logic

JOURNAL ARTICLE
21 PAGES

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

SHARE
Vol.75 • No. 2 • June 2010
Back to Top