Necessary use of induction in a reversal (Q3011120): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060740478 / 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: Forcing with tagged trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinacy of Wadge classes and subsystems of second order arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Equimorphism Types of Linear Orderings / rank
 
Normal rank

Latest revision as of 06:05, 4 July 2024

scientific article
Language Label Description Also known as
English
Necessary use of induction in a reversal
scientific article

    Statements

    Necessary use of induction in a reversal (English)
    0 references
    0 references
    28 June 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    reverse mathematics
    0 references
    \(\Sigma ^1_{1}\)-induction
    0 references
    weak \(\Sigma ^1_{1}\)-choice
    0 references
    linear orderings
    0 references
    scattered
    0 references
    indecomposable
    0 references
    0 references