Journal of Symbolic Logic · 2010 · 36 citations · 19 references
Natural SciencesComputer ScienceMathematicsAlgebraLogicSet TheoryAxiomatic Set TheoryBoolean AlgebraMany-valued LogicBoolean IdealsReducibilityTruth DegreesTruth-table ReducibilityTuring Reducibility
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.
19
Theory of Recursive Functions and Effective Computability
D. C. Cooper · The Computer Journal · 1969 · 2.6K citations · Full text
Recursively enumerable sets and degrees
Robert I. Soare · Bulletin of the American Mathematical Society · 1978 · 1.6K citations · Full text
The definition of random sequences
Per Martin-Löf · Information and Control · 1966 · 1.2K citations
A Generalization of a Fixed Point Theorem of Reich
G. E. Hardy, T. D. Rogers · Canadian Mathematical Bulletin · 1973 · 535 citations · Full text