Non-well-founded sets obtained from ideal fixed points

Motivated by ideas from the study of abstract data types, the authors show how to interpret non-well-founded sets as fixed points of continuous transformations of an initial continuous algebra. They consider a preordered structure closely related to the set HF of well-founded, hereditarily finite sets. By taking its ideal completion, the authors obtain an initial continuous algebra in which they are able to solve all of the usual systems of equations that characterize hereditarily finite, non-well-founded sets. In this way, they are able to obtain a structure which is isomorphic to HF/sub 1/, the non-well-founded analog to HF.<<ETX>>

[1]  Michael W. Mislove,et al.  Local compactness and continuous lattices , 1981 .

[2]  Peter Aczel,et al.  Non-well-founded sets , 1988, CSLI lecture notes series.

[3]  Joseph A. Goguen,et al.  Rational algebraic theories and fixed-point solutions , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[4]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

[5]  Joseph A. Goguen,et al.  Initial Algebra Semantics and Continuous Algebras , 1977, J. ACM.

[6]  R. T. P. Fernando.  On substitutional recursion over non-well-founded sets , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.