ISC Computer Science - Propositional Logic
Propositional Logic Logic is a formal method of reasoning. A proposition is an elementary atomic sentence that may either be true or false but may take no other value. A simple proposition is one that does not contain any other proposition as a part. A compound proposition is one with two or more simple propositions as parts. An operator or connective joins simple propositions into compounds. Following are the various types of connectives: 1. Disjunctive (OR) : It means at least one of the two arguments is true. OR is represented by + or ∨ . 2. Conjunctive (AND) : It means that both the arguments are true. AND is represented by or & or ∧ . 3. Conditional (Implication or If Then) : It means that if one argument is true then other argument is true. Implication is represented by ⇒ or → or ⊃ . 4. Bi-conditional (Equivalence or If And Only If): It means that either both arguments are true or both are false. Equivalence is represented