A game‐theoretic proof of Shelah's theorem on labeled trees (Q5119908): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1002/malq.201900060 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q4699198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3144550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4180340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better quasi-orders for uncountable cardinals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A large cardinal in the constructible universe / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/MALQ.201900060 / rank
 
Normal rank

Latest revision as of 16:00, 30 December 2024

scientific article; zbMATH DE number 7245193
Language Label Description Also known as
English
A game‐theoretic proof of Shelah's theorem on labeled trees
scientific article; zbMATH DE number 7245193

    Statements

    A game‐theoretic proof of Shelah's theorem on labeled trees (English)
    0 references
    0 references
    9 September 2020
    0 references

    Identifiers