<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2003-11-16 17:03:44Axioms of set theory Z notation Axiom of empty set Nothing Axiom of choice Zermelo–Fraenkel set theory Axiom of regularity Axiom of union Axiom of infinity Mathematical logic Mathematics Set theory |
Add to Reading List |
Math 220 Axioms for set theory | REGULAR PROBABILITY COMPARISONS IMPLY THE BANACH-TARSKI PARADOX ALEXANDER R. PRUSS Abstract. Consider the regularity thesis that each possible event has non-zero probability. H´ ajek challenges this in two ways: (a) theDocID: PxFu - View Document |
![Something from Nothing Tom Davis [removed] http://www.geometer.org/mathcircles October 24, 2000](https://www.pdfsearch.io/img/2e27c58b250aba96525bbc8277b2e507.jpg "Something from Nothing Tom Davis [removed] http://www.geometer.org/mathcircles October 24, 2000") | Something from Nothing Tom Davis [removed] http://www.geometer.org/mathcircles October 24, 2000DocID: FTk7 - View Document |
![Axiomatic Set Theory: Problem sheet[removed]a) Assuming ZF (ie. ZF∗ +Foundation) prove that the following two definitions of “ordinal” are equivalent: (i) An ordinal is a transitive set well-ordered by ∈. (ii) An o](https://www.pdfsearch.io/img/a7f22df2eedba8582df7690b5aac23c6.jpg "Axiomatic Set Theory: Problem sheet[removed]a) Assuming ZF (ie. ZF∗ +Foundation) prove that the following two definitions of “ordinal” are equivalent: (i) An ordinal is a transitive set well-ordered by ∈. (ii) An o") | Axiomatic Set Theory: Problem sheet[removed]a) Assuming ZF (ie. ZF∗ +Foundation) prove that the following two definitions of “ordinal” are equivalent: (i) An ordinal is a transitive set well-ordered by ∈. (ii) An oDocID: 9o0j - View Document |
 | Nonstandard Set Theories and Information Management VAROL AKMANDocID: 3WfL - View Document |
| Math 220 Axioms for set theoryDocID: 3nnd - View Document |