From two-valued logic to $k$-valued logic

Traditionally, it is believed that the lattices of clones in two-valued logic and $k$-valued logic are totally different. In the paper we show that despite the differences they have a lot in common, and many properties that follow from the Post lattice can be generalized to the multi-valued case. As an example we show that the most general polynomial algorithm for the constraint satisfaction problem on $k$-element set can be viewed as a combination of methods known for two-valued case.