Non-p-generic and strongly nonbranching degree (Q4290666): Difference between revisions

From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710401496743
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Lattice embeddings into the recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distribution of the generic recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching Degrees above low Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The density of the nonbranching degrees / 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: Q3905267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3724315 / 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: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The recursively enumerable degrees are dense / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819052 / rank
 
Normal rank

Latest revision as of 14:33, 22 May 2024

scientific article; zbMATH DE number 562741
Language Label Description Also known as
English
Non-p-generic and strongly nonbranching degree
scientific article; zbMATH DE number 562741

    Statements

    Non-p-generic and strongly nonbranching degree (English)
    0 references
    0 references
    8 August 1995
    0 references
    even prime powers
    0 references
    finite field
    0 references
    permutation polynomial
    0 references

    Identifiers