A game-theoretic proof of Shelah's theorem on labeled trees
英文摘要:
We give a new proof of a theorem of Shelah which states that for every family of labeled trees, if the cardinality $κ$ of the family is much larger (in the sense of large cardinals) than the cardinality $λ$ of the set of labels, more precisely if the partition relation $κ\to (ω)^{\mathord{<}ω}_λ$ holds, then there is a homomorphism from one labeled tree in the family to another. Our proof uses a characterization of such homomorphisms in terms of games.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。