An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees (Q3325709): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3942948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3315502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3962983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Pairs of Recursively Enumerable Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of recursively enumerable sets which have no maximal supersets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding minimal pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weak truth table degrees of recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable generic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting properties and jump classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jump restricted interpolation in the recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The recursively enumerable degrees are dense / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of Unsolvability. (AM-55) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of classes of RE sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The infinite injury priority method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity, speedable and levelable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable sets and degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal pair of recursively enumerable degrees / rank
 
Normal rank

Latest revision as of 11:53, 14 June 2024

scientific article
Language Label Description Also known as
English
An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
scientific article

    Statements

    0 references
    0 references
    0 references
    0 references
    1984
    0 references
    recursively enumerable degrees
    0 references
    promptly simple degrees
    0 references
    upper semilattice
    0 references
    An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees (English)
    0 references

    Identifiers