Bases for Chain-complete Posets

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

George Markowsky, Barry K. Rosen

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

06A06: Partial orders, general

68W30: Symbolic computation and algebraic computation

65G50: Roundoff error

68N01: General topics in the theory of software

03E20: Other classical set theory (including functions, relations, and set algebra)

68W99: Algorithms in computer science

Related Items

Decompositions for Relatively Normal Lattices, 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, 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 \(\omega\)-continuous posets in function spaces of domains, Infinite trees in normal form and recursive equations having a unique solution