Skip to main content
Log in

Logic of paradoxes in classical set theories

  • Published:
Synthese Aims and scope Submit manuscript

Abstract

According to Cantor (Mathematische Annalen 21:545–586, 1883; Cantor’s letter to Dedekind, 1899) a set is any multitude which can be thought of as one (“jedes Viele, welches sich als Eines denken läßt”) without contradiction—a consistent multitude. Other multitudes are inconsistent or paradoxical. Set theoretical paradoxes have common root—lack of understanding why some multitudes are not sets. Why some multitudes of objects of thought cannot themselves be objects of thought? Moreover, it is a logical truth that such multitudes do exist. However we do not understand this logical truth so well as we understand, for example, the logical truth \({\forall x \, x = x}\) . In this paper we formulate a logical truth which we call the productivity principle. Rusell (Proc Lond Math Soc 4(2):29–53, 1906) was the first one to formulate this principle, but in a restricted form and with a different purpose. The principle explicates a logical mechanism that lies behind paradoxical multitudes, and is understandable as well as any simple logical truth. However, it does not explain the concept of set. It only sets logical bounds of the concept within the framework of the classical two valued \({\in}\) -language. The principle behaves as a logical regulator of any theory we formulate to explain and describe sets. It provides tools to identify paradoxical classes inside the theory. We show how the known paradoxical classes follow from the productivity principle and how the principle gives us a uniform way to generate new paradoxical classes. In the case of ZFC set theory the productivity principle shows that the limitation of size principles are of a restrictive nature and that they do not explain which classes are sets. The productivity principle, as a logical regulator, can have a definite heuristic role in the development of a consistent set theory. We sketch such a theory—the cumulative cardinal theory of sets. The theory is based on the idea of cardinality of collecting objects into sets. Its development is guided by means of the productivity principle in such a way that its consistency seems plausible. Moreover, the theory inherits good properties from cardinal conception and from cumulative conception of sets. Because of the cardinality principle it can easily justify the replacement axiom, and because of the cumulative property it can easily justify the power set axiom and the union axiom. It would be possible to prove that the cumulative cardinal theory of sets is equivalent to the Morse–Kelley set theory. In this way we provide a natural and plausibly consistent axiomatization for the Morse–Kelley set theory.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Aczel P. (1977) An introduction to inductive definitions. In: Barwise J. (eds) Handbook of mathematical logic. North-Holland, Amsterdam

    Google Scholar 

  • Barwise, K. J., & Moss, L. (1996). Vicious circles. On the mathematics of non-wellfounded phenomena. CSLI Lecture Notes 60. CSLI Publications.

  • Boolos G. (1971) The iterative conception of set. Journal of Philosophy 68: 215–231

    Article  Google Scholar 

  • Boolos G. (1989) Iteration again. Philosophical Topics 17: 5–21

    Article  Google Scholar 

  • Cantor G. (1883) Uber unendliche, lineare punktmannigfaltigkeiten, 5. Mathematische Annalen 21: 545–586

    Article  Google Scholar 

  • Cantor, G. (1899). Cantor’s letter to Dedekind. English translation in (van Heijenoort, J. (Ed.). (1967). From Frege to Godel (pp. 113–117). Cambridge: Harvard university Press).

  • Fraenkel A. (1927) Zehn Vorlesungen uber die Grundlegung der Mengenlehre. Taubner, Leipzig

    Google Scholar 

  • Fraenkel A. (1928) Einleitung in die Mengenlehre. Springer, Berlin

    Google Scholar 

  • Fraenkel A. A., Hillel Y. B., Levy A. (1973) Foundations of set theory. North-Holland, Amsterdam

    Google Scholar 

  • Hallett M. (1984) Cantorian set theory and limitation of size Oxford logic guides 10. Clarendon Press, Oxford

    Google Scholar 

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

    Google Scholar 

  • Šikić Z. (1986) Cantors theorem and paradoxical classes. Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik 32(3): 221–226

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Boris Čulina.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Čulina, B. Logic of paradoxes in classical set theories. Synthese 190, 525–547 (2013). https://doi.org/10.1007/s11229-011-0047-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11229-011-0047-x

Keywords

Navigation