A combinatorial principle equivalent to the existence of non-free Whitehead groups

Simple item page
dc.creatorEklof, Paul C.
dc.creatorShelah, Saharon
dc.date1994-03-15
dc.date.accessioned2026-07-07T09:15:04Z
dc.date.available2026-07-07T09:15:04Z
dc.descriptionAs a consequence of identifying the principle described in the title, we prove that for any uncountable cardinal lambda, if there is a lambda-free Whitehead group of cardinality lambda which is not free, then there are many ``nice'' Whitehead groups of cardinality lambda which are not free.
dc.identifierhttps://arxiv.org/abs/math/9403220
dc.identifierhttp://arxiv.org/abs/math/9403220
dc.identifierContemp. Math. 171 (1994), 79--98
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/152898
dc.subjectLogic
dc.subjectRings and Algebras
dc.titleA combinatorial principle equivalent to the existence of non-free Whitehead groups
dc.typetext

Files

Collections

arXiv