COMPLETION FOR EQUIPPED POSETS
A. G. Zavadskij called completion to one of the algorithms of differentiation introduced by him to classify equipped posets of finite growth. In this paper, we describe the categorical properties of such an algorithm.
Auslander-Reiten quiver, categorical equivalence, category, equipped poset, Gabriel quiver, matrix problem, -space, poset, quiver, representations of posets.
