### Abstract

This paper is about partially ordered multisets (pomsets for short). We investigate a particular class of pomsets that we call order-deterministic, properly including all partially ordered sets, which satisfies a number of interesting properties: among other things, it forms a distributive lattice under pomset prefix (hence prefix closed sets of order-deterministic pomsets are prime algebraic), and it constitutes a reflective subcategory of the category of all pomsets. For the order-deterministic pomsets we develop an algebra with a sound and ($\omega$-) complete equational theory. The operators in the algebra are concatenation and join, the latter being a variation on the more usual disjoint union of pomsets. This theory is then extended in order to capture refinement of pomsets by incorporating homomorphisms between models as objects in the algebra and homomorphism application as a new operator.

Original language | Undefined |
---|---|

Article number | 10.1305/ndjfl/1040046090 |

Pages (from-to) | 283-320 |

Number of pages | 38 |

Journal | Notre Dame Journal of Formal Logic |

Volume | 37 |

Issue number | 2 |

DOIs | |

Publication status | Published - 1996 |

### Keywords

- EWI-8293
- IR-66660

## Cite this

Rensink, A. (1996). Algebra and Theory of Order-Deterministic Pomsets.

*Notre Dame Journal of Formal Logic*,*37*(2), 283-320. [10.1305/ndjfl/1040046090]. https://doi.org/10.1305/ndjfl/1040046090