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)

Related topics

Related topics

7 relations
Arithmetical hierarchyKönig's lemmaLow (computability)PA degree

Broader (1)

Computability theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2008
Review
2008
THE FINITE BASIS PROBLEM
A finite algebra of finite type (i.e., having just finitely many fundamental operations) is finitely based if the variety it… 
2007
2007
A note on semistar Noetherian domains
We study semistar Noetherian domains, that is, domains having the ascending chain condition on "quasi semistar ideals''.We… 
2005
2005
On the Complexity of a Grobner Basis Algorithm
While the computation of Grobner bases is known to be an expspace-complete problem, the generic behaviour of algorithms for their… 
2002
2002
Definable principal subcongruences
Abstract. For varieties of algebras, we present the property of having "definable principal subcongruences" (DPSC), generalizing… 
2002
2002
A LIMITING FIRST ORDER REALIZABILITY INTERPRETATION
Constructive Mathematics might be regarded as a fragment of classical mathematics in which any proof of an existence theorem is… 
2001
2001
Primitive complete normal bases for regular extensions
The extension E of degree n over the Galois field F={\text GF}(q)} is called regular over F, if {\text ord}_r(q) and n have… 
1997
1997
Generalized straightening laws for products of determinants
The (semi)standard Young tableau have been known since Hodge and Littlewood to naturally index a basis for the multihomogeneous… 
1987
1987
Primary ideal decomposition
This fact was discovered by Lasker, Macaulay [Lasker 1905, Macaulay t916], and in the special case of zero dimensional ideals… 
1978
1978
Some (ink, k) cyclic codes in quasi-cyclic form (Corresp.)
Without recourse to the normal basis theorem, some (mk, k) cyclic codes are put into quasi-cyclic form, and their weight… 
1975
1975
A finite basis theorem for packing boxes with bricks
Consider a catalogue S which lists one to infinitely many shapes of rectangular bricks with positive integer dimensions. Using as… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)