Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees (Q2430010): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q468085 / rank
Normal rank
 
Property / author
 
Property / author: Iskander Sh. Kalimullin / rank
Normal rank
 
Property / author
 
Property / author: Mariya Ivanova Soskova / rank
Normal rank
 
Property / author
 
Property / author: Marat M. Arslanov / rank
 
Normal rank
Property / author
 
Property / author: Iskander Sh. Kalimullin / rank
 
Normal rank
Property / author
 
Property / author: Mariya Ivanova Soskova / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.042 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W179285968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding the diamond in the Σ<sub>2</sub> enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Special Pairs of Σ2 e-Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4944900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3487329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properly Σ2 Enumeration Degrees / rank
 
Normal rank
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: Reducibility and Completeness for Sets of Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursively enumerable degree which will not split over all lesser ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal pairs of enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Types as Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetical Reducibilities I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties and Σ<sub>2</sub><sup>0</sup> enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-splitting theorem in the enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: How enumeration reductibility yields extended Harrington non-splitting / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:16, 3 July 2024

scientific article
Language Label Description Also known as
English
Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees
scientific article

    Statements

    Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees (English)
    0 references
    0 references
    0 references
    0 references
    5 April 2011
    0 references
    computability
    0 references
    enumeration reducibility
    0 references
    Ershov hierarchy
    0 references
    splitting
    0 references
    nonsplitting
    0 references

    Identifiers