 Cyclic negation

In many-valued logic with linearly ordered truth values, cyclic negation is a unary truth function that takes a truth value "n" and returns "n" − 1 as value if "n" is not the lowest value; otherwise it returns the highest value.For example, let the set of truth values be {0,1,2}, let ~ denote negation, and let "p" be a variable ranging over truth values.