In this work we introduce the notion of a canonic set, which arises in computing of semigroup cohomologies [n]. We investigate different properties of canonic sets and give examples of their applications to algorithmic problems.