A characterization of Plotkin's order in powerdomains, and some of its properties

Loading...
Thumbnail Image

Full text at PDC

Publication date

1984

Advisors (or tutors)

Editors

Journal Title

Journal ISSN

Volume Title

Publisher

Elsevier Science
Citations
Google Scholar

Citation

Frutos Escrig, D. «A Characterization of Plotkin’s Order in Powerdomains, and Some of Its Properties». Theoretical Computer Science, vol. 31, n.o 1-2, 1984, pp. 73-82. DOI.org (Crossref), https://doi.org/10.1016/0304-3975(84)90127-0.

Abstract

In 1976, Plotkin introduced powerdomains adapting to them, in some sense, Egli- Milner's order. Lately, Smyth (1978) presented the same results starting from generating trees, and adding a new order that he denoted by 0. He also gave a characterization of the first order M, without making any further use of it. This charactererization turned out to be wrong, and starting from this fact (which shall be proved in the sequel) I have developed a new one (which is the same as the one that has been exposed by Plotkin, although it has been got from another approach), obtaining in some cases a canonical representative of the equivalence classes induced by the preorder M. As it would be expected, this representative is maximal with respect to the ⊆-order. Nevertheless, in other cases such a canonical ‘representative’ would not be finitely generable, and some consequences of it will be exposed.

Research Projects

Organizational Units

Journal Issue

Description

Unesco subjects

Keywords

Collections