### Book chapter

## Total Equivalence Systems for Classes of 3-valued Projection Logic whose Projections Equal to the Class of Linear Boolean Functions

We give a complete description of total equivalence systems (TES) for formulas based on closed classes of functions from the projection logic P3,2 with the property that the restrictions of its functions to the set {0,1} constitute a closed class of linear Boolean functions. For each such class, we find a total equivalence system, providing an algorithm for a transformation of an arbitrary formula to its canonical form.