MTH_314_Cheat_Sheet

MTH_314_Cheat_Sheet - 1.1 – Intro Statement is true or...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1.1 – Intro: Statement is true or false, not both. DeMorgan’s Theorem : ~(p ∨ q) == ~p ^ ~q ~(p^q) == ~p ∨ ∼ q. Tautology : All Concluding values of TT=True Contradiction : Same as above but TT=False In general, questions don’t = statements. 1.2 – If Statements : If p, then q == p ニ q == ~p ∨ q (p:q:Conclusion) ニ (TTT,TFF,FTT,FFT) Contrapositive ~q ニ ~p Converse : q ニ p Inverse: ~p ニ ~q p only if q : If not q, then not p : p ニ q means ~p ∨ q p if q : If q, then p: q ニ p. Biconditional : p iff q: p must have same TT as q, else false. P ↔ Q (p:q:Conclusion) ニ (TTT,TFF,FTF,FFT) *** p ↔ q (p ニ q) ^ (q ニ p) Sufficient Condition : p is a necessary condition for q: If p, then q == p ニ q. Necessary Condition : p is a sufficient condition for q: If ~p, then ~q === ~p ニ ~q === q ニ p Negating : ~(p ニ q) == ~(~p ∨ q) == (p ^ ~q) Notes: p ニ q ≠ q ニ p, p ニ q ≠ ~p ニ ~q, p ニ q == ~q ニ ~p 1.3 – Valid Forms: Argument: Sequence of statements, called premises. There is a final statement called a conclusion. Argument is of valid form when: 1.) In TT, find all critical rows (row where all premises = true). 2.) If all conclusions = True for all critical rows, statement is of valid form, else not in valid form. Modus Ponens : p ニ q, p, ∴ q. Modus Tollens : p ニ q, ~q, ∴ ~p. Disjunctive Addition: p, ∴ p ∨ q or q, ∴ p ∨ q. Disjunctive Syllogism : p ∨ q, ~q, ∴ p or p ∨ q, ~p, ∴ q. Conjunctive Addition: p, q , ∴ p ∨ q. Conjunctive Simplification: p ^ q, ∴ p or p ^ q, ∴ q. Hypothetical Syllogism: p ニ q, q ニ r, ∴ p ニ r. Division into cases: p ∨ q, p ニ r, q ニ r, r. Rule of Contradiction : ~p ニ c, ∴ p. 5 – Sets : If x is a member of Set S, x ∈ S, else x not in S. S = {a, b, c}: Set s consists exactly of the elements a, b, c. Order doesn’t matter and ignore repetition. i.e {b,a,c} and {a,a,b,b,c,c}. Use (…) to indicate pattern continues. T = {x ∈ S | (P(x))} == T ‘equals’ the ‘set of x’ in S, s.t P(x). Set of all permissible objects = The Universe = U, {x ∈ U | (P(x))}. Φ = Empty Set A = Subset of B , A C B (B contains A), iff every element in A is also in B. (B has A’s stuff) A = B iff A has same exact elements in B. A = Proper Subset of B ( A C B) iff (A C B) and B not equal to A. Ex: A = {0,1,2,3] B = {1,2} B C A but B does not equal A. Intersection of A and B : A ∩ B = Elements which are both in A and B. Union of A and B : A U = Elements which are either in A or B. Example: A = {0,1,2,3} B = {0,1,2,4}. A U B = {0,1,2,3,4.}. A ∩ B = {0,1,2} Difference between A and B = B – A: Elements in B that are not in A. Compliment : A C : All elements in Set U which are not in A....
View Full Document

This note was uploaded on 04/17/2008 for the course MTH 314 taught by Professor Forgot during the Spring '08 term at Ryerson.

Page1 / 2

MTH_314_Cheat_Sheet - 1.1 – Intro Statement is true or...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online