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

Autor:	Trevor M. Wilson
Rok vydání:	2020
Předmět:	Combinatorics Set (abstract data type) Mathematics::Logic Tree (descriptive set theory) Cardinality Game theoretic Logic Mathematics::General Topology Partition (number theory) Homomorphism Characterization (mathematics) Omega Mathematics
Zdroj:	Mathematical Logic Quarterly. 66:190-194
ISSN:	1521-3870 0942-5616
DOI:	10.1002/malq.201900060
Popis:	We give a new proof of a theorem of Shelah which states that for every family of labeled trees, if the cardinality $\kappa$ of the family is much larger (in the sense of large cardinals) than the cardinality $\lambda$ of the set of labels, more precisely if the partition relation $\kappa \to (\omega)^{\mathord{
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::17fce44d2c4f7312b920bd402e13dfa9 https://doi.org/10.1002/malq.201900060 Zobrazit plný text záznamu