Burali-Forti paradox

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In set theory, a field of mathematics, the Burali-Forti paradox demonstrates that naïvely constructing "the set of all ordinal numbers" leads to a contradiction and therefore shows an antinomy in a system that allows its construction. It is named after Cesare Burali-Forti, who in 1897 published a paper proving a theorem which, unknown to him, contradicted a previously proved result. Bertrand Russell subsequently noticed the contradiction, and when he published it, he stated that it had been suggested to him by Burali-Forti's paper, with the result that it came to be known by Burali-Forti's name.[1]

Stated in terms of von Neumann ordinals[edit]

Let \Omega be the "set" of all ordinals. Since \Omega carries all properties of an ordinal number, it is an ordinal number itself. We can therefore construct its successor \Omega + 1, which is strictly greater than \Omega. However, this ordinal number must be an element of \Omega, since \Omega contains all ordinal numbers. Finally, we arrive at

\Omega < \Omega + 1 and \Omega + 1 < \Omega.

Stated more generally[edit]

The version of the paradox above is anachronistic, because it presupposes the definition of the ordinals due to John von Neumann, under which each ordinal is the set of all preceding ordinals, which was not known at the time the paradox was framed by Burali-Forti. Here is an account with fewer presuppositions: suppose that we associate with each well-ordering an object called its "order type" in an unspecified way (the order types are the ordinal numbers). The "order types" (ordinal numbers) themselves are well-ordered in a natural way, and this well-ordering must have an order type \Omega. It is easily shown in naïve set theory (and remains true in ZFC but not in New Foundations) that the order type of all ordinal numbers less than a fixed \alpha is \alpha itself. So the order type of all ordinal numbers less than \Omega is \Omega itself. But this means that \Omega, being the order type of a proper initial segment of the ordinals, is strictly less than the order type of all the ordinals, but the latter is \Omega itself by definition. This is a contradiction.

If we use the von Neumann definition, under which each ordinal is identified as the set of all preceding ordinals, the paradox is unavoidable: the offending proposition that the order type of all ordinal numbers less than a fixed \alpha is \alpha itself must be true. The collection of von Neumann ordinals, like the collection in the Russell paradox, cannot be a set in any set theory with classical logic. But the collection of order types in New Foundations (defined as equivalence classes of well-orderings under similarity) is actually a set, and the paradox is avoided because the order type of the ordinals less than \Omega turns out not to be \Omega.

Resolution of the paradox[edit]

Modern axiomatic set theory such as ZF and ZFC circumvents this antinomy by simply not allowing construction of sets with unrestricted comprehension terms like "all sets with the property P", as it was for example possible in Gottlob Frege's axiom system. New Foundations uses a different solution.

References[edit]

  1. ^ https://www.cs.auckland.ac.nz/~chaitin/lowell.html

External links[edit]