Graduate studies at Western
Journal of Symbolic Logic 48 (1):39-52 (1983)
|Abstract||Let ZF denote Zermelo-Fraenkel set theory (without the axiom of choice), and let $M$ be a countable transitive model of ZF. The method of forcing extends $M$ to another model $M\lbrack G\rbrack$ of ZF (a "generic extension"). If the axiom of choice holds in $M$ it also holds in $M\lbrack G\rbrack$, that is, the axiom of choice is preserved by generic extensions. We show that this is not true for many weak forms of the axiom of choice, and we derive an application to Boolean toposes|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Andreas Blass (1981). The Model of Set Theory Generated by Countably Many Generic Reals. Journal of Symbolic Logic 46 (4):732-752.
Mitchell Spector (1988). Ultrapowers Without the Axiom of Choice. Journal of Symbolic Logic 53 (4):1208-1219.
Harvey Friedman (2000). Does Mathematics Need New Axioms? The Bulletin of Symbolic Logic 6 (4):401 - 446.
Lorenz Halbeisen & Saharon Shelah (2001). Relations Between Some Cardinals in the Absence of the Axiom of Choice. Bulletin of Symbolic Logic 7 (2):237-261.
Vivian Charles Walsh (1967). On the Significance of Choice Sets with Incompatibilities. Philosophy of Science 34 (3):243-250.
Paul E. Howard (1973). Limitations on the Fraenkel-Mostowski Method of Independence Proofs. Journal of Symbolic Logic 38 (3):416-422.
Paul E. Howard, Arthur L. Rubin & Jean E. Rubin (1978). Independence Results for Class Forms of the Axiom of Choice. Journal of Symbolic Logic 43 (4):673-684.
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.
Added to index2009-01-28
Total downloads4 ( #190,122 of 755,029 )
Recent downloads (6 months)1 ( #63,372 of 755,029 )
How can I increase my downloads?