1 is true, 0 is false, and logical sum is equivalent to AND in mathematical judgment.

So 1 1 = 1 is true,10 = 0,00 = 0.

0 10 1 100 1^ 10 100 1 1 1=0000000 1

For example:

The Xor operation is usually used to negate a specific bit of a binary, because XOR can be defined as follows: 0 and 1 XOR 0 are unchanged, and XOR 1 is negated.

0 10 1 100 1

10 100 1 1 1

= 1 1 1 1 1 1 10

Extended data:

In formal logic, logical operators or logical conjunctions connect statements into more complex statements. For example, suppose there are two logical propositions, namely "It's raining" and "I'm indoors", and we can make them into such complex propositions as "I'm indoors when it's raining" or "I'm indoors if it's raining". A new statement or proposition composed of two statements is called a compound statement or a compound proposition.

Baidu Encyclopedia-Binary Logic Operation