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

DOI10.1016/0304-3975(84)90127-0zbMATH Open0584.68070OpenAlexW2104475322MaRDI QIDQ1069707FDOQ1069707

D. Frutos Escrig

Publication date: 1984

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(84)90127-0

zbMATH Keywords

treeenumerationdomainEgli-Milner's order

Mathematics Subject Classification ID

Partial orders, general (06A06) Theory of computing (68Q99)

Cites Work

• Title not available (Why is that?)
• Data Types as Lattices
• A Powerdomain Construction
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• On some partial orders on a certain subset of the power set of rings 👍 👎
• A note on the extension of an order on a set to the power set 👍 👎
• Orders in power semigroups 👍 👎
• \(P\)-orderings of finite subsets of Dedekind domains 👍 👎
• A note on well quasi-orderings for powersets 👍 👎
• Some characterizations and properties of a new partial order 👍 👎
• Fine analysis of the quasi-orderings on the power set 👍 👎
• Powers of ordered sets 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: A characterization of Plotkin's order in powerdomains, and some of its properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1069707)