Logic in Computer Science (LICS 1989)

Paper: Non-well-founded sets obtained from ideal fixed points (at LICS 1989)

Authors: Mislove, M.W. Moss, L.S. Oles, F.J.

Abstract

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₁, the non-well-founded analog to HF

BibTeX

  @InProceedings{MisloveMossOles-Nonwellfoundedsetso,
    author = 	 {Mislove, M.W. and Moss, L.S. and Oles, F.J.},
    title = 	 {Non-well-founded sets obtained from ideal fixed points},
    booktitle =  {Proceedings of the Fourth Annual IEEE Symp. on Logic in Computer Science, {LICS} 1989},
    year =	 1989,
    editor =	 {Rohit Parikh},
    month =	 {June}, 
    pages =      {263--272},
    location =   {Pacific Grove, CA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }