Bounding minimal degrees by computably enumerable degrees (Q4254684): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2307/2586653 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987361090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The jump is definable in the structure of the degrees of unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal degree less than 0’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of computability theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees joining to <b>0</b>′ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4863238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees which do not bound minimal degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3329452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: D.R.E. Degrees and the Nondiamond Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementing below recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal degrees of unsolvability and the full approximation construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Proofs of Some Theorems on High Degrees of Unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Initial segments of degrees below 0′ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Initial segments of the degrees of unsolvability Part II: minimal degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on minimal degrees / rank
 
Normal rank

Latest revision as of 21:09, 28 May 2024

scientific article; zbMATH DE number 1310798
Language Label Description Also known as
English
Bounding minimal degrees by computably enumerable degrees
scientific article; zbMATH DE number 1310798

    Statements

    Bounding minimal degrees by computably enumerable degrees (English)
    0 references
    0 references
    0 references
    0 references
    29 June 1999
    0 references
    0 references
    bounding minimal degrees
    0 references
    computably enumerable degrees
    0 references
    0 references