Skip to main content

Paradox, ZF, and the Axiom of Foundation

  • Chapter
  • First Online:
Logic, Mathematics, Philosophy, Vintage Enthusiasms

Part of the book series: The Western Ontario Series in Philosophy of Science ((WONS,volume 75))

Abstract

It is a great pleasure to contribute to this Festschrift for John Bell. No-one has done more than he has to demonstrate the fruitfulness of the interplay between technical mathematics and philosophical issues, and he is an inspiration to all of us who work somewhere in the borderland between mathematics and philosophy.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Logical cognoscenti know that this is false, but the view is common amongst those who are mathematically, but not logically, well-informed.

  2. 2.

    As far as I know, nobody has ever explicitly put forward the naive conception, though it is implicit in (Frege, 1893).

  3. 3.

    For the definition of well-founded, see below.

  4. 4.

    For more details, including attempts to apply the same idea to the semantic paradoxes, see (Rieger, 1996, Ch. 1) or (Priest, 1994) (Priest uses the terms transcendence and closure). Dummett’s idea of an indefinitely extensible concept (Dummett, 1991, p. 316) and the book (Grim, 1991) are also relevant. The basic idea can be found in (Russell, 1906c), which I discuss below.

  5. 5.

    Though it is not quite as explicit, the distinction between the transfinite and the absolute infinite can be found much earlier in Cantor’s writings (e.g., Cantor, 1883, p. 205). It seems likely that, having realized that any set can be enlarged by the power set operation, Cantor drew immediately the conclusion that there can be no universal set. Cantor is sometimes accused of believing in naive set theory (e.g., (Körner, 1960, p. 44): “Cantor’s theory of classes, by admitting as a class any collection, however formed, leads to contradictions”). This is quite unjustified: rather “his conception of set … was one in which the paradoxes cannot arise” (Menzel, 1984, p. 92); see also (Hallett, 1984, p. 38 and passim).

  6. 6.

    More precisely, the principle that a collection is too big to form a set iff it can be put into 1-1 correspondence with the universe can be taken as the basis for an axiomatization of set theory, as is done in (von Neumann, 1925).

  7. 7.

    A set x satisfying this condition is said to be well-founded.

  8. 8.

    To make the example work, interpret “discussed in this paper” so that it applies to only a small (e.g. finite) number of things.

  9. 9.

    For more details see (Aczel, 1988). I discuss the merits of the various anti-foundation axioms in (Rieger, 2000).

  10. 10.

    “Term” here just means “object.”

  11. 11.

    It might be thought that “limitation of size” embodies exactly the idea of restricting universality, but it is clear that Russell does not think of it in this way: rather he sees the theory as posing the question “how far up the series of ordinals it is legitimate to go” (p. 53), a question which he cannot see any prospect of answering.

  12. 12.

    The original has “of,” which seems to be a misprint.

  13. 13.

    The occurrence of “any” (and “some”) may seem puzzling here: since anything presumably concerns itself, the principle seems to rule out anything ever being a member of a class. But Russell should be read as forbidding any member of a class concerning quantification over the class.

  14. 14.

    To avoid confusion, I should perhaps make it clear that here and throughout the paper I use “constructivism” as a name for a metaphysical view about mathematics, roughly that mathematical objects are brought into existence by some activity of human minds. The term is sometimes now used for mathematics without the law of excluded middle, but I shall use it in its earlier sense.

  15. 15.

    This is a semantic paradox, introduced in (Richard, 1905), which concerns the collection E of all reals definable in a finite number of words; by a diagonal argument we can obtain a new real, not in E yet definable in a finite number of words.

  16. 16.

    The original italicises this sentence. At this point “non-predicative” means simply “not defining a class”; confusingly, Russell, having accepted the diagnosis, started using “impredicative” to mean “violating the vicious circle principle.”

  17. 17.

    My italics.

  18. 18.

    Goldfarb (1989) attempts to reconcile Russell’s predicativism with his lack of constructivism, arguing that his views on variables and their ranges of significance can lead to ramification of intensional entities (in particular propositions and propositional functions) even on a realist conception. But even if this is right—and Goldfarb says he is only making a “first step” (p. 27) towards a full treatment of the issue—the fact remains that Russell advocates the VCP in full generality. As Goldfarb admits (pp. 30–31), it is hard to see how the ramification of sets can be justified except on a constructivist view.

  19. 19.

    The axiom of foundation immediately rules out a universal set, for such a set would be a member of itself. But the point is that such a set is ruled out anyway by the other axioms. Foundation plays no role in solving the paradoxes.

  20. 20.

    Some other statements from Russell’s writings are to be found at the pages cited above, and also (Russell, 1906b, p. 204); (Whitehead and Russell, 1910, p. 37).

  21. 21.

    Gödel claims to discern a third principle, concerning “pre-supposing,” which I shall not discuss here.

  22. 22.

    This will not do as it stands as a characterization of impredicative definitions. For example it will be equally objectionable if, instead of x itself being a member of the totality, some second object y, defined using x, is a member. Presumably to make this rigorous we would require some notion of well-foundedness for definitions; I shall not attempt to supply details here.

  23. 23.

    The transitive closure of x is the set whose members are the members of x, the members of the members of x, and so on.

  24. 24.

    Though he does not state it explicitly, this seems to be what Gödel has in mind in his paper (see p. 131 with its footnote reference to Mirimanoff). It is a little too strong to say that VCP II entails the axiom of foundation, for an infinite descending membership chain \(x_{1} \ni x_{2} \ni \dots \) in which all the x i are different violates foundation without circularity. Such a chain seems equally offensive to the constructivist intuitions underpinning the VCPs, and suggests that they do not fully capture those intuitions.

  25. 25.

    There is disagreement, for example, on whether the axiom of replacement is derivable from the iterative conception.

  26. 26.

    A variation is possible in which instead we start with some atoms or urelements, that is, some non-sets. Though this is probably more natural from a naive point of view, mathematicians standardly work with a universe of pure sets, where everything is a set, since this is technically smoother (for example the quantifiers can simply be taken to range over all sets) and does not result in any limitation in structure. For present purposes the difference in the two approaches is not important.

  27. 27.

    More detailed marshallings of evidence against the iterative conception may be found in (Lavine, 1994, Ch. V; Hallett, 1984, Chs. 56). The overall conclusion of Hallett’s book, however, that “we have no satisfactory simple heuristic explanation of why it [ZF] works,” seems to me to be too strong. It is not mysterious that ZF avoids the paradoxes, since it is apparent from the axioms that the paradoxical collections are denied sethood. Hallett also makes much (in Chapter 5) of the technical result that we have very little idea of the size of the power set of ω, arguing that this refutes ZF’s claim to embody a “limitation of size” conception. This, however, seems to depend on thinking of “limitation of size” in the style of Russell, as “no sets allowed that are bigger than such-and-such a cardinal”; rather, as I have been trying to convey, the point is that however big it is, P(ω) is still a set, and therefore not as large as the universe. There is, however, another sense of “why ZF works” considered by Hallett: why it (or indeed any set theory) is adequate as a foundation for mathematics. I agree that this is genuinely mysterious, and I shall not try to solve the mystery here.

  28. 28.

    Boolos is using “ Sx” for “x is a set”.

  29. 29.

    In technical terms, the power set operation is not absolute. The issue is discussed by Hallett (1984, pp. 206–207, 221) and Hallett (1994, pp. 83–92).

  30. 30.

    I am simplifying the details of the theory to bring out the essential point.

Bibliography

  • Aczel, P. (1988). Non-well-founded Sets. CSLI, Stanford.

    Google Scholar 

  • Barwise, J. and Etchemendy, J. (1987). The Liar. Oxford University Press, Oxford.

    Google Scholar 

  • Barwise, J. and Moss, L. (1996). Vicious Circles. CSLI, Standford.

    Google Scholar 

  • Bell, J. L. and Machover, M. (1977). A Course in Mathematical Logic. North-Holland, Amsterdam.

    Google Scholar 

  • Benacerraf, P. and Putnam, H., editors (1983). Philosophy of Mathematics: Selected Readings. Cambridge University Press, Cambridge, second edition.

    Google Scholar 

  • Boolos, G. (1971). The iterative conception of set. Journal of Philosophy, 68:215–232. Reprinted in [Benacerraf and Putnam, 1983].

    Article  Google Scholar 

  • Cantor, G. (1883). Grundlagen einer allgemeinen Mannigfaltigkeitslehre. B.G. Teubner, Leipzig.

    Google Scholar 

  • Cantor, G. (1899). Letter to Dedekind. Translation in [van Heijenoort, 1967] pp. 113–117.

    Google Scholar 

  • Dummett, M. (1991). Frege: Philosophy of Mathematics. Harvard University Press, Cambridge, MA.

    Google Scholar 

  • Fraenkel, A. (1922). Zu den Grundlagen der Cantor-Zermeloschen Mengenlehre. Mathematische Annalen, 86:230–237.

    Article  Google Scholar 

  • Frege, G. (1893). Grundgesetze der Arithmetik, begriffsschriftlich abgeleitet, I. Pohle, Jena.

    Google Scholar 

  • Gödel, K. (1944). Russell’s mathematical logic. In Schilpp, P. A., editor, The Philosophy of Bertrand Russell. Tudor, New York, NY. Reprinted in [Benacerraf and Putnam, 1983].

    Google Scholar 

  • Gödel, K. (1947). What is Cantor’s continuum problem? American Mathematical Monthly, 54:515–525. Reprinted with revisions in [Benacerraf and Putnam, 1983].

    Article  Google Scholar 

  • Goldfarb, W. (1989). Russell’s reasons for ramification. In Savage, C. W. and Anderson, C. A., editors, Rereading Russell: Essays in Bertrand Russell’s Metaphysics and Epistemology, volume XII of Minnesota Studies in the Philosophy of Science, pages 24–40. University of Minnesota Press Minneapolis, MN.

    Google Scholar 

  • Grim, P. (1991). The Incomplete Universe. MIT Press, Cambridge, MA.

    Google Scholar 

  • Hallett, M. (1984). Cantorian Set Theory and Limitation of Size. Oxford University Press, Oxford.

    Google Scholar 

  • Hallett, M. (1994). Putnam and the Skolem pardox. In Clark, P. and Hale, B., editors, Reading Putnam, pages 66–97. Blackwells, Oxford.

    Google Scholar 

  • Körner, S. (1960). The Philosophy of Mathematics. Dover, New York, NY.

    Google Scholar 

  • Lavine, S. (1994). Understanding the Infinite. Harvard University Press, Cambridge, MA.

    Google Scholar 

  • Menzel, C. (1984). Cantor and the Burali-Forti paradox. Monist, 67:92–107.

    Google Scholar 

  • Mirimanoff, D. (1917a). Les antinomies de Russell et de Burali-Forti et le problème fondamental de la théorie des ensembles. L’Enseignement Mathématique, 19:37–52.

    Google Scholar 

  • Mirimanoff, D. (1917b). Remarques sur la théorie des ensembles et les antinomies Cantoriennes (I). L’Enseignement Mathématique, 19:208–217.

    Google Scholar 

  • Parsons, C. (1977). What is the iterative collection of set? In Butts, R. E. and Hintikka, J., editors, Proceedings of the 5th International Congress of Logic, Methodology and Philosophy of Science 1975, Part I: Logic, Foundations of Mathematics, and Computability Theory, pages 335–367. D. Reidel Dordrecht. Reprinted in [Benacerraf and Putnam, 1983] and in [Parsons, 1983].

    Google Scholar 

  • Parsons, C. (1983). Mathematics in Philosophy: Selected Essays. Cornell University Press, Ithaca, NY.

    Google Scholar 

  • Poincaré, J. H. (1906). Les mathématiques et la logique. Revue de metaphysique et de morale. Translation in [Poincaré, 1952].

    Google Scholar 

  • Poincaré, J. H. (1952). Science and Method. Dover New York, NY.

    Google Scholar 

  • Poincaré, J. H. (1963). Mathematics and Science: Last Essays. Dover, New York, NY.

    Google Scholar 

  • Priest, G. (1994). The structure of the paradoxes of self-reference. Mind, 103:25–34.

    Article  Google Scholar 

  • Richard, J. (1905). Les principes de mathématiques et le problème des ensembles. Revue générale des sciences pures et appliqués, 16:541. Translation in [van Heijenoort, 1967].

    Google Scholar 

  • Rieger, A. (1996). Circularity and Universality. D.Phil. thesis, University of Oxford.

    Google Scholar 

  • Rieger, A. (2000). An argument for Finsler-Aczel set theory. Mind, 109(434):241–253.

    Article  Google Scholar 

  • Russell, B. (1902). Letter to Frege, 16th June. In [van Heijenoort, 1967].

    Google Scholar 

  • Russell, B. (1906a). Les paradoxes de la logique. Revue de Métaphysique et de Morale, 14: 627–650.

    Google Scholar 

  • Russell, B. (1906b). On insolubilia and their solution by symbolic logic. Translation of [Russell, 1906a]; in [Russell, 1973].

    Google Scholar 

  • Russell, B. (1906c). On some difficulties in the theory of transfinite numbers and order types. Proceedings of the London Mathematical Society, series 2, 4:29–53. Reprinted in [Russell, 1973].

    Article  Google Scholar 

  • Russell, B. (1908). Mathematical logic as based on the theory of types. American Journal of Mathematics, 30:222–262. Reprinted in [Russell, 1956].

    Article  Google Scholar 

  • Russell, B. (1956). Logic and Knowledge, ed. Robert C. Marsh. Allen and Unwin, London.

    Google Scholar 

  • Russell, B. (1973). Essays in Analysis ed. Douglas Lackey. George Allen and Unwin, London.

    Google Scholar 

  • Shoenfield, J. R. (1967). Mathematical Logic. Addison-Wesley, Reading, MA.

    Google Scholar 

  • Shoenfield, J. R. (1977). Axioms of set theory. In Barwise, J., editor, Handbook of Mathematical Logic. North-Holland, Amsterdam.

    Google Scholar 

  • Skolem, T. (1922). Einige Bemerkungen zur axiomatischen Begründung der Mengenlehre. Matematikerkongressen i Helsingfors den 4–7 Juli, Den femte skandinaviska matematikerkongressen, Redogörelse. Translation in [van Heijenoort, 1967].

    Google Scholar 

  • van Heijenoort, J., editor (1967). From Frege to Gödel: A Source Book in Mathematical Logic, 1879-1931. Harvard University Press, Cambridge, MA.

    Google Scholar 

  • von Neumann, J. (1925). Eine Axiomatisierung der Mengenlehre. Journal für die reine und angewandte Mathematik, 154:219–240. Translation in [van Heijenoort, 1967].

    Article  Google Scholar 

  • von Neumann, J. (1928). Über die Definition durch transfinite Induktion und verwandte Fragen der allgemeinen Mengenlehre. Mathematische Annalen, 99:373–391.

    Article  Google Scholar 

  • von Neumann, J. (1929). Über eine Widerspruchsfreiheitsfrage in der axiomatischen Mengenlehre. Journal für die reine und angewandte Mathematik, 160:227–241.

    Article  Google Scholar 

  • Wang, H. (1974). From Mathematics to Philosophy. Routledge and Kegan Paul, London. Pages 181–223 reprinted as The concept of set in [Benacerraf and Putnam, 1983].

    Google Scholar 

  • Whitehead, A. N. and Russell, B. (1910). Principia Mathematica, Volume 1. Cambridge University Press, Cambridge.

    Google Scholar 

  • Zermelo, E. (1904). Beweis, dass jede Menge wohlgeordnet werden kann. Mathematische Annalen, 59:514–516. Translation in [van Heijenoort, 1967].

    Article  Google Scholar 

  • Zermelo, E. (1908). Untersuchungen über die Grundlagen der Mengenlehre, I. Mathematische Annalen, 65:261–281.

    Article  Google Scholar 

  • Zermelo, E. (1930). Über Grenzzahlen und Mengenbereiche: Neue Untersuchungen über die Grundlagen der Mengenlehre. Fundamenta Mathematicae, 16:29–47.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Adam Rieger .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media B.V.

About this chapter

Cite this chapter

Rieger, A. (2011). Paradox, ZF, and the Axiom of Foundation. In: DeVidi, D., Hallett, M., Clarke, P. (eds) Logic, Mathematics, Philosophy, Vintage Enthusiasms. The Western Ontario Series in Philosophy of Science, vol 75. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-0214-1_9

Download citation

Publish with us

Policies and ethics