Low basis theorem
Appearance
The low basis theorem in computability theory states that every nonempty class of (see analytical hierarchy) contains a set of low degree. It was first proved by Carl Jockusch and Robert I. Soare in 1972.
This is an old revision of this page, as edited by CBM (talk | contribs) at 21:36, 21 November 2010 (JStor template). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
The low basis theorem in computability theory states that every nonempty class of (see analytical hierarchy) contains a set of low degree. It was first proved by Carl Jockusch and Robert I. Soare in 1972.
This mathematical logic-related article is a stub. You can help Wikipedia by expanding it. |