2000 character limit reached
Quite free complicated abelian group, PCF and Black Boxes
Published 10 Apr 2014 in math.LO | (1404.2775v2)
Abstract: We like to build Abelian groups (or R-modules) which on the one hand are quite free, say -free, and on the other hand, are complicated in suitable sense. We choose as our test problem having no non-trivial homomorphism to (known classically for -free, recently for -free). We succeed to prove the existence of even free ones. This requires building n-dimensional black boxes, which are quite free. Thus combinatorics is of self interest and we believe will be useful also for other purposes. On the other hand, modulo suitable large cardinals, we prove that it is consistent that every -free Abelian group has non-trivial homomorphisms to Z.
Paper Prompts
Sign up for free to create and run prompts on this paper.