Aczel's anti-foundation axiom
In the foundations of mathematics, Aczel's anti-foundation axiom is an axiom set forth by Peter Aczel (1988), as an alternative to the axiom of foundation in Zermelo–Fraenkel set theory. It states that every accessible pointed directed graph corresponds to exactly one set. In particular, according to this axiom, the graph consisting of a single vertex with a loop corresponds to a set that contains only itself as element, i.e. a Quine atom. A set theory obeying this axiom is necessarily a non-well-founded set theory.
Accessible pointed graphs
An accessible pointed graph is a directed graph with a distinguished vertex (the "root") such that for any node in the graph there is at least one path in the directed graph from the root to that node.
The anti-foundation axiom postulates that each such directed graph corresponds to the membership structure of exactly one set. For example, the directed graph with only one node and an edge from that node to itself corresponds to a set of the form x = {x}.
See also
- von Neumann universe
References
- Aczel, Peter (1988). Non-well-founded sets.. CSLI Lecture Notes. 14. Stanford, CA: Stanford University, Center for the Study of Language and Information. ISBN 978-0-937073-22-3. https://archive.org/details/nonwellfoundedse0000acze. Retrieved 2008-03-12.
- Goertzel, Ben (1994). "Self-Generating Systems". Chaotic Logic: Language, Thought and Reality From the Perspective of Complex Systems Science. Plenum Press. ISBN 978-0-306-44690-0. http://www.goertzel.org/books/logic/chapter_seven.htm. Retrieved 2007-01-15.
- Akman, Varol; Pakkan, Mujdat (1996). "Nonstandard set theories and information management". Journal of Intelligent Information Systems 6 (1): 5–31. doi:10.1007/BF00712384. http://www.cs.bilkent.edu.tr/~akman/jour-papers/jiis/jiis.pdf.
de:Fundierungsaxiom#Mengenlehren ohne Fundierungsaxiom
 |  |
