CSEENGRDiscreteMathematics.pptVIP

* * * * * * * * * * * * * * * * * * * CSE115/ENGR160 Discrete Mathematics01/26/12 Ming-Hsuan Yang UC Merced * 1.6 Rules of Inference Proof: valid arguments that establish the truth of a mathematical statement Argument: a sequence of statements that end with a conclusion Valid: the conclusion or final statement of the argument must follow the truth of proceeding statements or premise of the argument * Argument and inference An argument is valid if and only if it is impossible for all the premises to be true and the conclusion to be false Rules of inference: use them to deduce (construct) new statements from statements that we already have Basic tools for establishing the truth of statements * Valid arguments in propositional logic Consider the following arguments involving propositions “If you have a correct password, then you can log onto the network” “You have a correct password” therefore, “You can log onto the network” * premises conclusion Valid arguments is tautology When ((p→q)?p) is true, both p→q and p are ture, and thus q must be also be true This form of argument is true because when the premises are true, the conclusion must be true * Example p: “You have access to the network” q: “You can change your grade” p→q: “If you have access to the network, then you can change your grade” “If you have access to the network, then you can change your grade” (p→q) “You have access to the network” (p) so “You can change your grade” (q) * Example “If you have access to the network, then you can change your grade” (p→q) “You have access to the network” (p) so “You can change your grade” (q) Valid arguments But the conclusion is not true Argument form: a sequence of compound propositions involving propositional variables * Rules of inference for propositional logic Can always use truth table to show an argument form is valid For an argument form with 10 propositional variables, the truth table requires 21