¡Nos trasladamos! E-Prints cerrará el 7 de junio.

En las próximas semanas vamos a migrar nuestro repositorio a una nueva plataforma con muchas funcionalidades nuevas. En esta migración las fechas clave del proceso son las siguientes:

Es muy importante que cualquier depósito se realice en E-Prints Complutense antes del 7 de junio. En caso de urgencia para realizar un depósito, se puede comunicar a docta@ucm.es.

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



Downloads per month over past year

Frutos Escrig, David de (1984) A characterization of Plotkin's order in powerdomains, and some of its properties. Theoretical Computer Science, 31 (1-2). pp. 73-82. ISSN 0304-3975

[thumbnail of Frutos34elsevier.pdf] PDF
Restringido a Repository staff only


Official URL: http://www.sciencedirect.com/science/article/pii/0304397584901270


n 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.

Item Type:Article
Subjects:Sciences > Computer science
ID Code:20781
Deposited On:11 Apr 2013 11:11
Last Modified:10 Aug 2018 08:10

Origin of downloads

Repository Staff Only: item control page