On the jump classes of noncuppable enumeration degrees (Q3083133): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A high noncuppable \({\Sigma^0_2}\) \(e\)-degree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4417312 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The \(n\)-rea enumeration degrees are dense / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Goodness in the enumeration and singleton degrees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Limit lemmas and jump inversion in the enumeration degrees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On minimal pairs of enumeration degrees / rank | |||
Normal rank |
Revision as of 21:04, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the jump classes of noncuppable enumeration degrees |
scientific article |
Statements
On the jump classes of noncuppable enumeration degrees (English)
0 references
18 March 2011
0 references
enumeration reducibility
0 references
Turing degrees
0 references
noncuppable
0 references