Skip to search formSkip to main contentSkip to account menu

Low basis theorem

Known as: Basis theorem 
The low basis theorem in computability theory states that every nonempty class in (see arithmetical hierarchy) contains a set of low degree (Soare… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2008
Review
2008
A finite algebra of finite type (i.e., having just finitely many fundamental operations) is finitely based if the variety it… 
2007
2007
We study semistar Noetherian domains, that is, domains having the ascending chain condition on "quasi semistar ideals''.We… 
2002
2002
Constructive Mathematics might be regarded as a fragment of classical mathematics in which any proof of an existence theorem is… 
1997
1997
The (semi)standard Young tableau have been known since Hodge and Littlewood to naturally index a basis for the multihomogeneous… 
1978
1978
Without recourse to the normal basis theorem, some (mk, k) cyclic codes are put into quasi-cyclic form, and their weight… 
1968
1968
ƒ = k[xi9 • • • , #» , %n+i, • • • » #iv] = £[-X"i, • • • , XivJ/O, where Q = (gi, • • • , q8) is a, finitely generated ideal… 
1964
1964
In a paper of nearly thirty years ago (Mahler 1937) I first studied approximation properties of algebraic number fields relative…