Forcing and reducibilities (Q3041177): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5528627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some applications of forcing to hierarchy problems in arithmetic / 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: THE INDEPENDENCE OF THE CONTINUUM HYPOTHESIS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility orderings: Theories, definability and automorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transfinite extensions of Friedberg's completeness criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: The upper semi-lattice of degrees of recursive unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On degrees of recursive unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On degrees of unsolvability / rank
 
Normal rank

Latest revision as of 10:05, 14 June 2024

scientific article
Language Label Description Also known as
English
Forcing and reducibilities
scientific article

    Statements

    Forcing and reducibilities (English)
    0 references
    1983
    0 references
    n-generic set
    0 references
    forcing in arithmetic
    0 references
    Feferman forcing
    0 references
    Sacks forcing
    0 references
    arithmetic sets
    0 references
    Turing degrees
    0 references
    arithmetical degrees
    0 references

    Identifiers