Lazy groupoids
Balázs Kaprinai, Hajime Machida, Tamás Waldhauser · Semigroup Forum · 2020
Abstract A binary operation f(x, y) is said to be lazy if every operation that can be obtained from f by composition is equivalent to f(x, y), f(x, x) or x. We describe lazy operations by identities (i.e., we determine all varieties of lazy groupoids), and we also characterize lazy groupoids up to isomorphism.