z-logo
open-access-imgOpen Access
Presenting Dcpos and Dcpo Algebras
Author(s) -
Achim Jung,
M. Andrew Moshier,
Steve Vickers
Publication year - 2008
Publication title -
electronic notes in theoretical computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.242
H-Index - 60
ISSN - 1571-0661
DOI - 10.1016/j.entcs.2008.10.013
Subject(s) - mathematics , algebra over a field , characterization (materials science) , locale (computer software) , pure mathematics , algebraic number , discrete mathematics , computer science , programming language , mathematical analysis , materials science , nanotechnology
Dcpos can be presented by preorders of generators and inequational relations expressed as covers. Algebraic operations on the generators (possibly with their results being ideals of generators) can be extended to the dcpo presented, provided the covers are “stable” for the operations. The resulting dcpo algebra has a natural universal characterization and satisfies all the inequational laws satisfied by the generating algebra. Applications include known “coverage theorems” from locale theory

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom