Open Access
2001 On Non-wellfounded Sets as Fixed Points of Substitutions
Tapani Hyttinen, Matti Pauna
Notre Dame J. Formal Logic 42(1): 23-40 (2001). DOI: 10.1305/ndjfl/1054301353

Abstract

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.

Citation

Download Citation

Tapani Hyttinen. Matti Pauna. "On Non-wellfounded Sets as Fixed Points of Substitutions." Notre Dame J. Formal Logic 42 (1) 23 - 40, 2001. https://doi.org/10.1305/ndjfl/1054301353

Information

Published: 2001
First available in Project Euclid: 30 May 2003

zbMATH: 1023.03048
MathSciNet: MR1993388
Digital Object Identifier: 10.1305/ndjfl/1054301353

Subjects:
Primary: 03E30
Secondary: 03E65 , 03E70

Keywords: fixed point , non-wellfounded sets , substitution

Rights: Copyright © 2001 University of Notre Dame

Vol.42 • No. 1 • 2001
Back to Top