Partitioning pairs of countable ordinals

DC Field	Value	Language
dc.contributor.author	Todorčević, Stevo	en
dc.date.accessioned	2020-05-01T20:29:30Z	-
dc.date.available	2020-05-01T20:29:30Z	-
dc.date.issued	1987-12-01	en
dc.identifier.issn	0001-5962	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/2268	-
dc.description.abstract	It is proved that all pairs of countable ordinals can be colored with uncountably many colors in such a way that every uncountable set of ordinals contains a pair of every color. The proof does not use the existence of certain uncountable linear orders, as was the case in previous work on this subject, but employs the concept of a special Aronszajn tree.	-
dc.relation.ispartof	Acta Mathematica	en
dc.title	Partitioning pairs of countable ordinals	en
dc.type	Article	en
dc.identifier.doi	10.1007/BF02392561	en
dc.identifier.scopus	2-s2.0-0001352964	en
dc.relation.firstpage	261	en
dc.relation.lastpage	294	en
dc.relation.issue	1	en
dc.relation.volume	159	en
dc.description.rank	M21a	-
item.openairetype	Article	-
item.grantfulltext	none	-
item.fulltext	No Fulltext	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.cerifentitytype	Publications	-
crisitem.author.orcid	0000-0003-4543-7962	-

177

checked on May 21, 2025

17

checked on Jan 31, 2025

Check