Connectives Let p and q be statements. It is called the conjunction of p and q . It is called the disjunction of p and q . The Exclusive OR of p and q , denoted by , is the proposition that is true when exactly one of p and q is true and false otherwise. The only time an implication is not true is when a true statement implies a false one.
Examples is true . is false .
Conditional Connectives Conditional evaluation prevents the consideration of undefined components in specifications, e.g. a subscript that is out of range. For , CAND acts like AND when both p and q need to be evaluated. For , COR acts like OR when both p and q need to be evaluated. The conditional AND is denoted by . The conditional OR is denoted by .