A game-theoretic proof of Shelah's theorem on labeled trees

DOI10.1002/MALQ.201900060MaRDI QIDQ6323297arXivFDO

Authors Trevor M. Wilson

Publication date 7 August 2019

Published in arXiv

Full work available at URL https://doi.org/10.1002/MALQ.201900060

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Large cardinals (03E55)

arXiv classification

math.LO

Abstract: We give a new proof of a theorem of Shelah which states that for every family of labeled trees, if the cardinality

k a p p a

of the family is much larger (in the sense of large cardinals) than the cardinality

l a m b d a

of the set of labels, more precisely if the partition relation

k a p p a o (o m e g a)_{l}^{m a t h o r d < o m e g a} a m b d a

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.

This page was built for publication: A game-theoretic proof of Shelah's theorem on labeled trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6323297)