Limitations on the Fraenkel-Mostowski method of independence proofs
Journal of Symbolic Logic 38 (3):416-422 (1973)
| 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 | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,701 |
| External links |
|
| Through your library | Configure |
Norbert Brunner (1989). The Fraenkel-Mostowski Method, Revisited. Notre Dame Journal of Formal Logic 31 (1):64-75.
David Pincus (1972). Zermelo-Fraenkel Consistency Results by Fraenkel-Mostowski Methods. Journal of Symbolic Logic 37 (4):721-743.
G. P. Monro (1983). On Generic Extensions Without the Axiom of Choice. Journal of Symbolic Logic 48 (1):39-52.
T. E. Forster & J. K. Truss (2003). Non-Well-Foundedness of Well-Orderable Power Sets. Journal of Symbolic Logic 68 (3):879-884.
U. Felgner & J. K. Truss (1999). The Independence of the Prime Ideal Theorem From the Order-Extension Principle. Journal of Symbolic Logic 64 (1):199-215.
Paul Howard & Jean E. Rubin (1995). The Axiom of Choice for Well-Ordered Families and for Families of Well- Orderable Sets. Journal of Symbolic Logic 60 (4):1115-1117.
David Pincus (1997). The Dense Linear Ordering Principle. Journal of Symbolic Logic 62 (2):438-456.
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads3 ( #202,008 of 549,122 )Recent downloads (6 months)0How can I increase my downloads? |

