¥ r : rt F F ~ We can clearly see that the truth y. sions are equivalent. es of A € sar ere s yr V (AA B) and A are same: Ore, these expy . es 4.3 Propositional Logic Pale iia lie ow wel ew Seeenaewas >ropositional logic (or prop logic) deals with the validity, satisfiability (also called consisten ) ind unsatisfiability (inconsistency) of a formula and the derivation of a new formula cs quivalence laws. Each row of a truth table for a given formula ais called its interpretation a vhich the value of a formula may be either true or false. A formula @ is said to be a tautology if nd only if the value of @ is true for all its interpretations. Now, the validity, satisfiability, and nsatisfiability of a formula may be determined on the basis of the following conditions: