Splitting and nonsplitting, II: A low<sub>2</sub> c.e. degree above which <i>0</i>′ is not splittable (Q4451726): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the distribution of Lachlan nonsplitting bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properly Σ2 Enumeration Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4511553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Working below a \(low_ 2\) recursively enumerable degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The recursively enumerable degrees are dense / 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: Interpolation and embedding in the recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable sets of positive integers and their decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degrees less than 0' / rank
 
Normal rank

Latest revision as of 15:06, 6 June 2024

scientific article; zbMATH DE number 2048401
Language Label Description Also known as
English
Splitting and nonsplitting, II: A low<sub>2</sub> c.e. degree above which <i>0</i>′ is not splittable
scientific article; zbMATH DE number 2048401

    Statements