VALIDATION & SUBSTITUTION : Boolean logic

1. Boolean logic refers to the system of mathematical logic
2. It is used to create logical rules or statements
3. These logical statements are used to analyze, select, and process data
4. Logical statements can be linked using operators
5. An operator links logical statements and defines how the statements should be processed
6. A combined statement is two or more logical statements linked together.

Boolean logic is used in:

Report Writer
Validation
Substitution

 

TRUE / FALSE : is a logical proposition that is either true or false

AND (conjunction)

Both statements must be true for the combined statement to be true.

(Condition A) AND (Condition B) = In this case if Codition A & Condition B are true then only total statement becomes true to move further on posting.

Example : (GL = 900000) AND (cOST CENTER = A001CD1000)

while posting system check whether GL = 900000 AND cOST CENTER = A001CD1000

(10 > 6) AND (2 + 2 = 4) (TRUE)
 
(2 + 2 = 4) AND (10 < 6) (FALSE)
 
(10 < 6) AND (2 + 2 = 4) (FALSE)
 
(2 + 3 = 4) AND (10 < 6) (FALSE)

OR (disjunction)

At least one of the statements must be true for the combined statement to be true.

(Condition A) OR (Condition B) = In this case if Codition A or Condition B are true then only total combined statement becomes true to move further on posting.

Example : (GL = 900000) OR (cOST CENTER = A001CD1000)

while posting system check whether GL = 900000 OR cOST CENTER = A001CD1000

(10 > 6) OR (2 + 2 = 4) (TRUE)
 
(2 + 2 = 4) AND (10 < 6) (TRUE)
 
(10 < 6) AND (2 + 2 = 4) (TRUE)
 
(2 + 3 = 4) AND (10 < 6) (FALSE)

NOT (negation)

Statement that follows the NOT operator must be false for the statement to be true.

NOT (2 + 2 = 4) (FALSE)
 
NOT (10 < 6) (TRUE)
 

NAND (NOT AND)

At least one statement must be false for the combined statement to be true.

Example :

 

(2 + 2 = 4) NAND (10 > 6)  (FALSE)
 
(2 + 2 = 4) NAND (10 < 6) (TRUE)
 
(10 < 6) NAND (2 + 2 = 4) (TRUE)
 
(2 + 3 = 4) NAND (10 < 6) (TRUE)
 

NOR (NOT OR)

Both statements must be false for the combined statement to be true.

 

Example :

(2 + 2 = 4) NOR (10 > 6) (FALSE)
 
(2 + 2 = 4) NOR (1 = 2) (FALSE)
 
(2 + 1 = 4) NOR (2 + 2 = 4) (FALSE)
 
(2 + 1 = 4) NOR (10 < 6) (TRUE)
 

--> (implication)

The two statements depend on each other to determine the truth value of the statement, if the second statement is true or the first statement is false, the combined truth value is true.

 

Example :

(1 = 1) --> (2 + 4 = 6) (TRUE)
 
(2 + 2 = 4) --> (10 < 6) (FALSE)
 
(10 < 6) --> (2 + 2 = 4) (TRUE)
 
(10 < 6) --> (2 + 3 = 4) (TRUE)
 

<-> (equivalence)

Both statements must be true or both statements must be false for the combined statement to be true.

 

Example :

 

(1 = 1) <-> (2 + 2 = 4) (TRUE)
 
(1 = 1) <-> (10 < 6) (FALSE)
 
(10 < 6) <-> (1 = 1) (FALSE)
 
(2 + 3 = 4) <-> (10 < 6) (TRUE)

source: help.sap.com