Domination, forcing, array nonrecursiveness and relative recursive enumerability (Q5388717): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Bounding non-GL<sub>2</sub> and R.E.A. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-MINIMAL NON-GL<sub>2</sub> DEGREE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Array nonrecursiveness and relative recursive enumerability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3197814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing degrees of certain isomorphic images of computable relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial principles weaker than Ramsey's Theorem for pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double jumps of minimal degrees / 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: On degrees of unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of the Degrees below <b>0</b> ′ / rank
 
Normal rank
Property / cites work
 
Property / cites work: DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative enumerability and 1-genericity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness for genericity / rank
 
Normal rank

Latest revision as of 01:48, 5 July 2024

scientific article; zbMATH DE number 6025957
Language Label Description Also known as
English
Domination, forcing, array nonrecursiveness and relative recursive enumerability
scientific article; zbMATH DE number 6025957

    Statements

    Identifiers