Non-well-founded sets modeled as ideal fixed points

DOI10.1016/0890-5401(91)90051-3MaRDI QIDQ757360zbMATH OpenOpenAlexFDO

Authors Michael Mislove, Lawrence S. Moss, Frank J. Oles

Publication date 1991

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0890-5401(91)90051-3

zbMATH Keywords

abstract data typesideal completionnon-well-founded setsfixed points of continuous transformations of an initial continuous algebrapreordered structurewell-founded, hereditarily finite sets

Mathematics Subject Classification ID

Continuous lattices and posets, applications (06B35) Abstract data types; algebraic specification (68Q65) Other set-theoretic hypotheses and axioms (03E65)

Cites work

• scientific article; zbMATH DE number 4181325 (Why is no real title available?)
• scientific article; zbMATH DE number 4154410 (Why is no real title available?)
• scientific article; zbMATH DE number 3706504 (Why is no real title available?)
• scientific article; zbMATH DE number 42735 (Why is no real title available?)
• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• scientific article; zbMATH DE number 4193663 (Why is no real title available?)
• A Powerdomain Construction
• Calculi for synchrony and asynchrony
• Initial Algebra Semantics and Continuous Algebras
• On the algebraic specification of infinite objects - ordered and continuous models of algebraic types
• The Category-Theoretic Solution of Recursive Domain Equations

Cited in

(15)

• Full abstraction and recursion
• Models for a paraconsistent set theory
• Coalgebraic logic
• A category of compositional domain-models for separable Stone spaces.
• On the final sequence of a finitary set functor
• scientific article; zbMATH DE number 4181325 (Why is no real title available?)
• A general construction of hyperuniverses
• Topology, domain theory and theoretical computer science
• Non-well-founded extensions of V
• Hypersets
• Processes and hyperuniverses
• Free set algebras satisfying systems of equations
• Linear ordering on graphs, anti-founded sets and polynomial time computability
• A model with a precipitous ideal, but no normal precipitous ideal
• On non-wellfounded sets as fixed points of substitutions

This page was built for publication: Non-well-founded sets modeled as ideal fixed points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757360)