Limitations on the Fraenkel-Mostowski method of independence proofs

Journal of Symbolic Logic 38 (3):416-422 (1973)
  Copy   BIBTEX

Abstract

The Fraenkel-Mostowski method has been widely used to prove independence results among weak versions of the axiom of choice. In this paper it is shown that certain statements cannot be proved by this method. More specifically it is shown that in all Fraenkel-Mostowski models the following hold: 1. The axiom of choice for sets of finite sets implies the axiom of choice for sets of well-orderable sets. 2. The Boolean prime ideal theorem implies a weakened form of Sikorski's theorem

Other Versions

No versions found

Similar books and articles

The dense linear ordering principle.David Pincus - 1997 - Journal of Symbolic Logic 62 (2):438-456.
MA(ℵ0) restricted to complete Boolean algebras and choice.Eleftherios Tachtsis - 2021 - Mathematical Logic Quarterly 67 (4):420-431.
Von Rimscha's Transitivity Conditions.Paul Howard, Jean E. Rubin & Adrienne Stanley - 2000 - Mathematical Logic Quarterly 46 (4):549-554.

Analytics

Added to PP
2009-01-28

Downloads
149 (#286,299)

6 months
32 (#272,931)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Boolean Algebras.Roman Sikorski - 1966 - Journal of Symbolic Logic 31 (2):251-253.
International Symposium on the Theory of Models. - 1962 - Journal of Symbolic Logic 27 (1):128-129.

Add more references