Forcing and reductibilities. II. Forcing in fragments of analysis (Q3691651): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2307/2273465 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039493583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jumping through the transfinite: the master code hierarchy of Turing degrees / 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: 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: Hierarchies of number-theoretic predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order theory of the degrees of recursive unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On homogeneity and definability in the first-order theory of the Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The homogeneity conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the reducibility of \(\Pi_ 1^ 1\) sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees joining to <b>0</b>′ / rank
 
Normal rank

Latest revision as of 18:51, 14 June 2024

scientific article
Language Label Description Also known as
English
Forcing and reductibilities. II. Forcing in fragments of analysis
scientific article

    Statements

    Identifiers