Partially ordered monoids
In: http://math.chapman.edu/structuresold/files/Partially_ordered_monoids.pdf, 2004
Online
academicJournal
Zugriff:
math.chapman.edu/structures 1 Definition 1. A partially ordered monoid is a structure A = 〈A, ·, 1, ≤ 〉 such that 〈A, ·, 1 〉 is a monoid 〈G, ≤ 〉 is a partially ordered set · is orderpreserving: x ≤ y = ⇒ wxz ≤ wyz Remark: This is a template. If you know something about this class, click on the “Edit text of this page ” link at the bottom and fill out this page. It is not unusual to give several (equivalent) definitions. Ideally, one of the definitions would give an irredundant axiomatization that does not refer to other classes. Morphisms. Let A and B be partially ordered monoids. A morphism from A to B is a function h: A → B that is an orderpreserving homomorphism: h(x·y) = h(x)·h(y), h(1) = 1, x ≤ y = ⇒ h(x) ≤ h(y) edit Definition 2. A. is a structure A = 〈A,. 〉 of type 〈. 〉 such that. is.: axiom. is.: axiom
Titel: |
Partially ordered monoids
|
---|---|
Autor/in / Beteiligte Person: | Pomon, Abbreviation ; The Pennsylvania State University CiteSeerX Archives |
Link: | |
Zeitschrift: | http://math.chapman.edu/structuresold/files/Partially_ordered_monoids.pdf, 2004 |
Veröffentlichung: | 2004 |
Medientyp: | academicJournal |
Sonstiges: |
|