Cited in
(27)- Completion of Boolean algebras in MSet
- Fundamental properties of infinite trees
- Order completion monads
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- \(\mathbb{T}^\omega\) as a universal domain
- Effectively given domains
- CPO's of measures for nondeterminism
- On the algebra of order
- Varieties of chain-complete algebras
- Petri nets, event structures and domains. I
- Tree constructions of free continuous algebras
- A note on the existence of continuous functionals
- Embedding metric spaces into CPO's
- On some classes of interpretations
- Embedding -continuous posets in function spaces of domains
- Transporting continuity properties from a poset to its subposets
- Fixed points in digital topology (via Helly posets)
- Atomicity, coherence of information, and point-free structures
- Infinite trees in normal form and recursive equations having a unique solution
- Torsion elements in effect algebras
- Decompositions for Relatively Normal Lattices
- Uniform completion versus ideal completion of posets with projections
- Fixing Zeno gaps
- Convex powerdomains. I
- The largest Cartesian closed category of domains
- A uniform approach to inductive posets and inductive closure
- Two categories of effective continuous cpos
This page was built for publication: Bases for Chain-complete Posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4094899)
