The Order of Linear Relational Hypersubstitutions for Algebraic Systems

Dara Phusanga, Nareupanat Lekkoksung

Abstract

We introduce the concept of a linear relational hypersubstitution for algebraic systems which extends the concept of linear hypersubstitutions of universal algebras. The set of all linear relational hypersubstitutions together with an operation introduced in [1] form a monoid. For this monoid and a particular type τ = ((m); (n)), we determine the order of its elements.