On Martin’s pointed tree theorem (Q5740206): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complexity of winning strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal chains in the Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytic determinacy and 0<sup>#</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Basis Result for ∑ 0 3 Sets of Reals with an Application to Minimal Covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The axiom of determinateness and reduction principles in the analytical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof of Projective Determinacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On initial segment complexity and degrees of randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A model of set-theory in which every set of reals is Lebesgue measurable / rank
 
Normal rank

Latest revision as of 08:52, 12 July 2024

scientific article; zbMATH DE number 6606014
Language Label Description Also known as
English
On Martin’s pointed tree theorem
scientific article; zbMATH DE number 6606014

    Statements

    On Martin’s pointed tree theorem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 July 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    reverse mathematics
    0 references
    algorithmic randomness
    0 references
    Martin's pointed tree theorem
    0 references
    weak Martin's pointed tree theorem
    0 references
    0 references