Abstract

Douglass B. Morris announced in 1970 that it is consistent with Z F \mathsf {ZF} that “For every α \alpha , there exists a set A α A_\alpha which is the countable union of countable sets, and P ( A α ) \mathcal P(A_\alpha ) can be partitioned into ℵ α \aleph _\alpha non-empty sets”. The result was never published in a journal (it was proved in full in Morris’ dissertation) and seems to have been lost, save a mention in Jech’s “Axiom of Choice”. We provide a proof using modern tools derived from recent work of the author. We also prove a new preservation theorem for general products of symmetric systems, which we use to obtain the consistency of Dependent Choice with the above statement (replacing “countable union of countable sets” by “union of κ \kappa sets of size κ \kappa ”).

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.