In truth table the Logical disjunction or logical alternation is a compound sentence that is obtained by using the word ‘or’ which means to join two simple sentences.
Suppose the value of one operand is true then result we find is also true. And if the values of both operands are false, then the result we get will also be false or the result will be true if at least one of its operands is true.
Symbolically, the truth table for S OR P can be written as S v P or S + P. Now we will discuss how to define Truth Tables.
S v P truth table for disjunction function:
S P S v P
T T T
T F T
F T T
F F F
Now we will see the truth table for negation function:
The truth table of negation is given as:
If we put value of 'S' as True then we get the negation of 'S' as false. And if we put the value of 'S' as false then we get the negation of 'S' as true. This is all about truth tables.