nLab enriched directed loop graph

Contents

Contents

Idea

A directed loop graph may be understood as a thin (0,1)-directed pseudograph, hence as a thin directed pseudograph enriched over the cartesian monoidal poset of truth values. In generalization, one may speak of enriching directed loop graphs over other monoidal posets.

Defintion

Let (M,,,)(M, \leq, \wedge, \top) be a monoidal poset, such as a meet-semilattice. A MM-enriched directed loop graph or directed loop graph enriched over/in MM is a set PP with a binary function o:P×PMo:P \times P \to M

Examples

See also

Created on May 30, 2022 at 09:57:07. See the history of this page for a list of all contributions to it.