How to represent XOR of two decimal Numbers with Arithmetic Operators Is there any way to represent XOR of two decimal Numbers using Arithmetic Operators (+,-,*,/,%).

Looking at p. 309 of Fuzzy Sets and Fuzzy Logic: Theory and Applications by George Klir and Bo Yuan, I notice Reichenbach implication as 1-a+ab, with "a" and "b" presumed as belonging to {0, 1}.  XOR means the same thing basically as the negation of logical equivalence.  Logical equivalence can get represented as "the conjunction of p implies q, and q implies p."  Modeling "not a" as 1-a on {0, 1}, and conjunction as the product ab, then logical equivalence becomes (1-a+ab)(1-b+ab).  So, it's negation becomes 1-(1-a+ab)(1-b+ab)=1-(1-b+ab-a+ab-aab+ab-abb+aabb)=b-ab+a-ab+aab-ab+abb-aabb=a+b-3ab+aab+abb-aabb, which behaves just like XOR on {0, 1}, as you might want to check for yourself.  
The Klir and Yuan text also points out that 1-a+aab will work for implication, so a formula for XOR could get derived from that.  Also, if you allow "max" and "min", the maximum and minimum of two numbers respectively, many other functions for logical implication can get written, and for logical conjunction which makes many more formulas not all too hard to write.
