825
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

A Paradox Arising from the Elimination of a Paradox

Pages 306-318 | Received 13 Apr 2017, Accepted 27 Feb 2018, Published online: 22 Apr 2019

References

  • Banaschewski, B., Moore, G. H. (1990). The dual Cantor–Bernstein theorem and the partition principle. Notre Dame J. Formal Logic. 31(9): 375–381. DOI: 10.1305/ndjfl/1093635502.
  • Dougherty, R., Jackson, S., Kechris, A. S. (1994). The structure of hyperfinite Borel equivalence relations. Trans. Amer. Math. Soc. 341(1): 193–225. DOI: 10.1090/S0002-9947-1994-1149121-0.
  • Feferman, S. (2000). Mathematical intuition vs. mathematical monsters. Synthèse. 125(3): 317–332.
  • Gao, S. (2008). Invariant Descriptive Set Theory. Boca Raton, FL: Chapman and Hall/CRC.
  • Hardin, C. S., Taylor, A. D. (2008). A peculiar connection between the axiom of choice and predicting the future. Amer. Math. Monthly. 115(2): 91–96. DOI: 10.1080/00029890.2008.11920502.
  • Hardin, C. S., Taylor, A. D. (2013). The Mathematics of Coordinated Inference. New York: Springer.
  • Herrlich, H. (2006). Axiom of Choice. Berlin: Springer.
  • Jech, T. J. (2013). The Axiom of Choice. New York: Dover.
  • Kanamori, A. (2003). The Higher Infinite, 2nd. ed. New York: Springer.
  • Kechris, A. (1995). Classical Descriptive Set Theory. Graduate Texts in Mathematics, Vol. 156. New York: Springer.
  • Kerr, D., Li, H. (2013). Ergodic Theory: Independence and Dichotomies. New York: Springer.
  • Moore, G. H. (1982). Zermelo’s Axiom of Choice. New York: Springer.
  • Mycielski, J. (1964). On the axiom of determinateness. Fund. Math. 53: 205–224. DOI: 10.4064/fm-53-2-205-224.
  • Mycielski, J. (2006). A system of axioms of set theory for the rationalists. Notices Amer. Math. Soc. 53(2): 206–213.
  • Mycielski, J., Osofsky, B. (1975). Problem 5937 solution. Amer. Math. Monthly. 82(3): 308–309. DOI: 10.2307/2319871.
  • Oxtoby, J. C. (1971). Measure and Category. Graduate Texts in Mathematics, Vol. 2. New York: Springer.
  • Penrose, R. (2005). The Road to Reality. New York: Knopf.
  • Raisonnier, J. (1984). A mathematical proof of S. Shelah’s theorem on the measure problem and related results. Israel J. Math. 48: 48–56. DOI: 10.1007/BF02760523.
  • Shelah, S. (1984). Can you take Solovay’s inaccessible away? Israel J. Math. 48(1): 1–47. DOI: 10.1007/BF02760522.
  • Sierpiński, W. (1917). Sur quelques problèmes qui impliquent des fonctions non-mesurables. Comptes Rendus Acad. Sci. Paris. 164: 882–884.
  • Sierpiński, W. (1918). L’axiome de M. Zermelo et son rôle dans la théorie des ensembles et l’analyse. Bull. Acad. Sci. Cracovie Math. Sciences A. 97–152.
  • Sierpiński, W. (1938). Fonctions additives non complètement additives et fonctions non mesurables. Fund. Math. 30: 96–99. DOI: 10.4064/fm-30-1-96-99.
  • Sierpiński, W. (1947). Sur une proposition qui entraîne l’existence des ensembles non mesurables. Fund. Math. 34: 1–5.
  • Solovay, R. M. (1970). A model of set theory in which every set of reals is Lebesgue measurable. Ann. Math. 92: 1–56. DOI: 10.2307/1970696.
  • Stern, J. (1985). Regularity properties of definable sets of reals. Ann. Pure App. Logic. 29(3): 289–324. DOI: 10.1016/0168-0072(85)90003-X.
  • Tomkowicz, G., Wagon, S. (2016). The Banach–Tarski Paradox, 2nd ed. New York: Cambridge Univ. Press.
  • Weisstein, E. W. (2018). Harmonic expansion, MathWorld—A Wolfram Web Resource. mathworld.wolfram.com/HarmonicExpansion.html

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.