Notre Dame Journal of Formal Logic
- Notre Dame J. Formal Logic
- Volume 42, Number 1 (2001), 23-40.
On Non-wellfounded Sets as Fixed Points of Substitutions
We study the non-wellfounded sets as fixed points of substitution. For example, we show that ZFA implies that every function has a fixed point. As a corollary we determine for which functions f there is a function g such that $ g = g \star f$. We also present a classification of non-wellfounded sets according to their branching structure.
Notre Dame J. Formal Logic, Volume 42, Number 1 (2001), 23-40.
First available in Project Euclid: 30 May 2003
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Hyttinen, Tapani; Pauna, Matti. On Non-wellfounded Sets as Fixed Points of Substitutions. Notre Dame J. Formal Logic 42 (2001), no. 1, 23--40. doi:10.1305/ndjfl/1054301353. https://projecteuclid.org/euclid.ndjfl/1054301353