Minimal upper bounds for arithmetical degrees (Q4302349): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56913209, #quickstatements; #temporary_batch_1707161894653
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.2307/2275404 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074376599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two theorems on degrees of models of true arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The impossibility of finding relative complements for recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong anticupping property for recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees joining to <b>0</b>′ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for the arithmetical degrees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:20, 22 May 2024

scientific article; zbMATH DE number 618229
Language Label Description Also known as
English
Minimal upper bounds for arithmetical degrees
scientific article; zbMATH DE number 618229

    Statements

    Minimal upper bounds for arithmetical degrees (English)
    0 references
    0 references
    15 August 1994
    0 references
    arithmetical degrees
    0 references
    arithmetical functions
    0 references
    generic set
    0 references
    minimal upper bound
    0 references

    Identifiers