Professional Documents
Culture Documents
Cornell Notes: - LOGIC PROOFS
Cornell Notes: - LOGIC PROOFS
Cornell Notes
________________LOGIC PROOFS_____________
Page Numbers
_________
CONDITIONAL STATEMENTS IT IS AN IF-THEN STATEMENT, WHERE IF THE HYPOTHESIS IS FALSE AND THE CONCLUSION IS TRUE MEANS ITS CORRECT. P (F) ----> Q (T)=VALID/TRUE BUT IF THE HYPOTHESIS IS TRUE, AND THE CONCLUSION FALSE, THEN THE TRUTH VALUE IS ENTIRELY FALSE. P(T) ---------> Q(F)=INVALID/FALSE P------->Q Q -----------------------= INVALID. IF THE CONCLUSION IS THE SECOND STATEMENT, THEN IT IS INVALID BECAUSE THE SECOND STATEMENT COULD IMPLY ANY HYPOTHESIS. EXAMPLE: LET P=LUKE EATS BACON LET Q=LUKE IS HAPPY P------>Q(IF LUKE EATS BACON, THEN HE IS HAPPY) Q (LUKE IS HAPPY) __________________________________ INVALID (LUKES HAPPINESS COULD BE CAUSED BY MANY OTHER THINGS, RATHER THAN JUST FROM HIM EATING BACON)
CONVERSE STATEMENTS
CONVERSE STATEMENTS ARE STATEMENTS THAT ARE CREATED WHEN YOU SWITCH THE ORDER OF A CONDITIONAL STATEMENT. EXAMPLE: P------->Q (CONDITIONAL STATEMENT) TO Q------->P (CONVERSE STATEMENT.) THE CONVERSE STATEMENT AND CONDITIONAL STATEMENT ARE NOT EQUAL, UNLESS THE CONDITIONAL STATEMENT IS. IF BOTH STATEMENTS ARE TRUE AND OR IF BOTH STATEMENTS ARE FALSE, THEN THE CONVERSE IS TRUE. EXAMPLES: P(T)----->Q(T)= Q(T)---->P(T) P(F)----->Q(F)= Q(F)----->P(F) (True truth value.) or: P(T)---->Q(F)= Q(F)----->P(T) (this makes the statement true.)
INVERSE STATEMENTS
AN INVERSE STATEMENT IS WHEN YOU NEGATE A CONDITIONAL STATEMENT. EXAMPLE: P--->Q BECOMES ~P----->~Q THE INVERSE OF A CONDITIONAL STATEMENT IS ALWAYS EQUAL TO THE CONVERSE. P--->Q BECOMES, WHEN INVERSED,: ~Q--->~P WHICH IS EQAUL TO THE CONVERSE: Q---->P IF THE CONVERSE IS FALSE, THEN THE INVERSE IS FALSE, AND VICE VERSA.
CONTRAPOSITIVE STATEMENTS
A CONTRAPOSITIVE STATEMENT IS WHEN YOU FLIP THE ORDER OF THE CONDITIONAL STATEMENT AND INVERSE IT. P----->Q BECOMES ~Q----->~P THE CONTRAPOSITIVE ARE ALWAYS EQUAL TO THE CONDITIONAL STATEMENTS TRUTH VALUE P--->Q IS TRUE, THEN ~Q---->~P IS A TRUE STATEMENT.
CONJUNCTIONS
STATEMENTS WITH AND ^=AND BOTH MUST BE TRUE, OR ELSE THE ENTIRE THING IS FALSE.
DISJUNCTION
STATEMENTS WITH OR V=OR PVQ EITHER ONE CAN BE TRUE FOR THE STATEMENT TO BE TRUE, BUT EITHER ONE MUST BE TRUE. P(T)---->Q(F) IS A VALID STATEMENT P(F)----->Q(T) IS A VALID STATEMENT P(F)------>Q(F) IS AN INVALID STATEMENT
NEGATION
WHEN YOU CHANGE THE MEANING OF A STATEMENT. LIKE: LUKE LOVES BACON (P) TO LUKE DOES NOT LIKE BACON (~P) BUT IT CAN BE VICE VERSA LUKE DOES NOT LIKE BACON (P) TO LUKE DOES LIKE BACON (~P) JUST BECAUSE SOMETHING IS NEGATED USUALLY DOESNT MEAN IT WILL BE A FALSE STATEMENT.
BI CONDITIONAL STATEMENTA BI CONDITIONAL STATEMENT ARE WHEN TWO CONDITIONAL STATEMENTS ARE CONNECTED WITH AND USUALLY REPRESENTED WITH A DOUBLE ENDED ARROW. OR SIMPLY P---->Q ^ Q---->P BOTH MUST HAVE THE SAME TRUTH VALUE IN ORDER TO BE TRUE. LIKE: IF P(F)--->Q(F) ^ Q(F)----->P(F) IS TRUE OR P(T)---->Q(T)^ Q(T)------>P(T) IS TRUE LAW OF MODUS TOLLENS IF WE KNOW Q IS NOT TRUE THAN WE CAN THAT P IS NOT TRUE. P--->Q ~Q _____________________ ~P
LAW OF DETACHMENT
IF WE KNOW THAT P IS TRUE, WE CAN IMPLY Q IS TRUE. P---->Q P ____________ Q EXAMPLE: WE CAN IMPLY THAT ~(P^Q) IS EQUAL TO ~PV~Q THE SIGN EVEN CHANGES, LIKE ^ TO V ANDV TO ^
DEMORGANS LAW