Bases for Chain-complete Posets

DOI10.1147/rd.202.0138zbMath0329.06001OpenAlexW2028000879MaRDI QIDQ4094899

Barry K. Rosen, George Markowsky

Publication date: 1976

Published in: IBM Journal of Research and Development (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1147/rd.202.0138

Mathematics Subject Classification ID

Partial orders, general (06A06) Symbolic computation and algebraic computation (68W30) Roundoff error (65G50) General topics in the theory of software (68N01) Other classical set theory (including functions, relations, and set algebra) (03E20) Algorithms in computer science (68W99)

Related Items

Transporting continuity properties from a poset to its subposets ⋮ Embedding \(\omega\)-continuous posets in function spaces of domains ⋮ Atomicity, coherence of information, and point-free structures ⋮ Equivalences and transformations of regular systems - applications to recursive program schemes and grammars ⋮ Two categories of effective continuous cpos ⋮ \(\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 ⋮ Torsion elements in effect 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 ⋮ Decompositions for Relatively Normal Lattices ⋮ Unnamed Item ⋮ Uniform Completion versus Ideal Completion of Posets with Projections ⋮ Fixing Zeno gaps ⋮ Infinite trees in normal form and recursive equations having a unique solution ⋮ Convex powerdomains. I ⋮ On some classes of interpretations ⋮ The largest Cartesian closed category of domains ⋮ Completion of Boolean algebras in MSet ⋮ Fundamental properties of infinite trees ⋮ Order completion monads ⋮ A uniform approach to inductive posets and inductive closure