Cyclic negation
Encyclopedia
In logic
, cyclic negation is (assuming that the truth values are linearly ordered) a unary truth function that takes a truth value n and returns n-1 as value if n isn't the lowest value; otherwise it returns the highest value. For example, let (i) be the set of truth values be {0,1,2}, (ii) '~' denote negation, and (iii) p be a variable over truth values (i.e. whose range is truth values). Thus if p=0 then ~p=2; and if p=1 then ~p=0.
It was originally introduced by the logician and mathematician Emil Post
.
Logic
In philosophy, Logic is the formal systematic study of the principles of valid inference and correct reasoning. Logic is used in most intellectual activities, but is studied primarily in the disciplines of philosophy, mathematics, semantics, and computer science...
, cyclic negation is (assuming that the truth values are linearly ordered) a unary truth function that takes a truth value n and returns n-1 as value if n isn't the lowest value; otherwise it returns the highest value. For example, let (i) be the set of truth values be {0,1,2}, (ii) '~' denote negation, and (iii) p be a variable over truth values (i.e. whose range is truth values). Thus if p=0 then ~p=2; and if p=1 then ~p=0.
It was originally introduced by the logician and mathematician Emil Post
Emil Leon Post
Emil Leon Post was a mathematician and logician. He is best known for his work in the field that eventually became known as computability theory.-Early work:...
.