Non-well-founded set theory

Non-well-founded set theories are variants of axiomatic set theory that allow sets to contain themselves and otherwise violate the rule of well-foundedness. In non-well-founded set theories, the foundation axiom of ZFC is replaced by axioms implying its negation.

The study of non-well-founded sets was initiated by Dmitry Mirimanoff in a series of papers between 1917 and 1920, in which he formulated the distinction between well-founded and non-well-founded sets; he did not regard well-foundedness as an axiom. Although a number of axiomatic systems of non-well-founded sets were proposed afterwards, they did not find much in the way of applications until Peter Aczel’s hyperset theory in 1988.[1]

The theory of non-well-founded sets has been applied in the logical modelling of non-terminating computational processes in computer science (process algebra and final semantics), linguistics and natural language semantics (situation theory), philosophy (work on the Liar Paradox), and in a different setting, non-standard analysis.[2]

Details

In 1917, Dmitry Mirimanoff introduced[3] the concept of well-foundedness of a set:

A set, x0, is well-founded iff it has no infinite descending membership sequence:
· · · \in x_2 \in x_1 \in x_0.

In ZFC, there is no infinite descending ∈-sequence by the axiom of regularity. In fact, the axiom of regularity is often called the foundation axiom since it can be proved within ZFC− (that is, ZFC without the axiom of regularity) that well-foundedness implies regularity. In variants of ZFC without the axiom of regularity, the possibility of non-well-founded sets with set-like ∈-chains arises. For example, a set A such that A ∈ A is non-well-founded.

Although Mirimanoff also introduced a notion of isomorphism between possibly non-well-founded sets, he considered neither an axiom of foundation nor of anti-foundation.[4] In 1926 Paul Finsler introduced the first axiom that allowed non-well-founded sets. After Zermelo adopted Foundation into his own system in 1930 (from previous work of von Neumann 1925–1929) interest in non-well-founded sets waned for decades.[5] An early non-well-founded set theory was Willard Van Orman Quine’s New Foundations, although it is not merely ZF with a replacement for Foundation.

Several proofs of the independence of Foundation from the rest of ZF were published in 1950s particularly by Paul Bernays (1954), following an announcement of the result in earlier paper of his from 1941, and by Ernst Specker who gave a different proof in his Habilitationsschrift of 1951, proof which was published in 1957. Then in 1957 Rieger’s theorem was published, which gave a general method for such proof to be carried out, rekindling some interest in non-well-founded axiomatic systems.[6] The next axiom proposal came in a 1960 congress talk of Dana Scott (never published as a paper), proposing an alternative axiom now called SAFA.[7] Another axiom proposed in the late 1960s was Maurice Boffa’s axiom of superuniversality, described by Aczel as the highpoint of research of its decade.[8] Boffa’s idea was to make foundation fail as badly as it can (or rather, as extensionality permits): Boffa’s axiom implies that every extensional set-like relation is isomorphic to the elementhood predicate on a transitive class.

A more recent approach to non-well-founded set theory, pioneered by M. Forti and F. Honsell in the 1980s, borrows from computer science the concept of a bisimulation. Bisimilar sets are considered indistinguishable and thus equal, which leads to a strengthening of the axiom of extensionality. In this context, axioms contradicting the axiom of regularity are known as anti-foundation axioms, and a set that is not necessarily well-founded is called a hyperset.

Four mutually independent anti-foundation axioms are well-known, sometimes abbreviated by the first letter in the following list:

  1. AFA (‘Anti-Foundation Axiom’) – due to M. Forti and F. Honsell (this is also known as Aczel’s anti-foundation axiom);
  2. SAFA (‘Scott’s AFA’) – due to Dana Scott,
  3. FAFA (‘Finsler’s AFA’) – due to Paul Finsler,
  4. BAFA (‘Boffa’s AFA’) – due to Maurice Boffa.

They essentially correspond to four different notions of equality for non-well-founded sets. The first of these, AFA, is based on accessible pointed graphs (apg) and states that two hypersets are equal if and only if they can be pictured by the same apg. Within this framework, it can be shown that the so-called Quine atom, formally defined by Q={Q}, exists and is unique.

Each of the axioms given above extends the universe of the previous, so that: V ⊆ A ⊆ S ⊆ F ⊆ B. In the Boffa universe, the distinct Quine atoms form a proper class.[9]

It is worth emphasizing that hyperset theory is an extension of classical set theory rather than a replacement: the well-founded sets within a hyperset domain conform to classical set theory.

Applications

Aczel’s hypersets were extensively used by Jon Barwise and John Etchemendy in their 1987 book The Liar, on the liar’s paradox; The book is also good introduction to the topic of non-well-founded sets.

Boffa’s superuniversality axiom has found application as a basis for axiomatic nonstandard analysis.[10]

See also

Notes

  1. ↑ Pakkan and Akman (1994, section link); Rathjen (2004); Sangiorgi (2011) pp. 17–19 and 26
  2. ↑ Ballard & Hrbáček (1992).
  3. ↑ Levy (2002), p. 68; Hallett (1986), p. 186; Aczel (1988) p. 105 all citing Mirimanoff (1917)
  4. ↑ Aczel (1988) p. 105
  5. ↑ Aczel (1988), p. 107.
  6. ↑ Aczel (1988), pp. 107–108.
  7. ↑ Aczel (1988), pp. 108–109.
  8. ↑ Aczel (1988), p. 110.
  9. ↑ Nitta,Okada,Tsouvaras (2003)
  10. ↑ Kanovei & Reeken (2004), p. 303.

References

Further reading

External links

This article is issued from Wikipedia - version of the Thursday, February 19, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.