INSTALL
लोकप्रिय
"Scientific Approach"
374 ने देखा
•
3 घंटे पहले
Maths
#maths
11
8
कमेंट
Your browser does not support JavaScript!
![maths - Reasoning Complete Rules Mathemarical 1. STATEMENT २. SIMPLE & COMPOUND STATEMENTS Simple sfafemenf A sfqfement is & senfence thqt is cannof be broken false buf nof both true further eifher Or using formed Compound sfafemenf Examples: logical connecfives 2 + 3 = 5 (True) is an even number (False) 4. TRUTH VALUES TABLE (SUMMARY) pAq pVq ٥»٩ p<q ३. LOGICAL CONNECTIVES =٥ p FTF (a) Negation (-p) = T If p is True; -p is false F If p is false -p is frue. ٤ T F F T ٤ (b) Conjunction (p^q) Read as p AND q 5. TAUTOLOGY & CONTRADICTION True only when both p and are Tautology always frue True dlways false Contradiction (c) Disjunction (p ٧و) Read as p OR False only when both p and 6. CONVERSE INVERSE & CONTRAPOSITIVE are false For p -> ৭: Converse - q p (d) Implication (p > q) Inverse 7p 7q [f P, then q Read as Confraposifive > -q 7p 2 False only when p is True ond ৭ contrapositive] p =0 is fdlse; (e) Biconditional (p < 9) 8. QUANTIFIERS p if qnd only if q" Read as (a) Universal Quanfifier 7 VALID & INVALID ARGUMENTS for all Meaning: An argument is valid if the conclusion (b) Existential Quantifier (3) logicqlly follows from premises.. Meaningः there exists 9. NEGATION OF STATEMENTS WITH 0. IMPORTANT POINTS QUANTIFIERS definife A statement must havel truth value -(Vx p(x)) = Jx -p(x) Mathematical reasoning is logic-based} -(3x p(x)) = Vx -p(x) not cdlculdtion-bused verify compound help Trufh tqbles statements Reasoning Complete Rules Mathemarical 1. STATEMENT २. SIMPLE & COMPOUND STATEMENTS Simple sfafemenf A sfqfement is & senfence thqt is cannof be broken false buf nof both true further eifher Or using formed Compound sfafemenf Examples: logical connecfives 2 + 3 = 5 (True) is an even number (False) 4. TRUTH VALUES TABLE (SUMMARY) pAq pVq ٥»٩ p<q ३. LOGICAL CONNECTIVES =٥ p FTF (a) Negation (-p) = T If p is True; -p is false F If p is false -p is frue. ٤ T F F T ٤ (b) Conjunction (p^q) Read as p AND q 5. TAUTOLOGY & CONTRADICTION True only when both p and are Tautology always frue True dlways false Contradiction (c) Disjunction (p ٧و) Read as p OR False only when both p and 6. CONVERSE INVERSE & CONTRAPOSITIVE are false For p -> ৭: Converse - q p (d) Implication (p > q) Inverse 7p 7q [f P, then q Read as Confraposifive > -q 7p 2 False only when p is True ond ৭ contrapositive] p =0 is fdlse; (e) Biconditional (p < 9) 8. QUANTIFIERS p if qnd only if q" Read as (a) Universal Quanfifier 7 VALID & INVALID ARGUMENTS for all Meaning: An argument is valid if the conclusion (b) Existential Quantifier (3) logicqlly follows from premises.. Meaningः there exists 9. NEGATION OF STATEMENTS WITH 0. IMPORTANT POINTS QUANTIFIERS definife A statement must havel truth value -(Vx p(x)) = Jx -p(x) Mathematical reasoning is logic-based} -(3x p(x)) = Vx -p(x) not cdlculdtion-bused verify compound help Trufh tqbles statements - ShareChat](https://cdn4.sharechat.com/bd5223f_s1w/compressed_gm_40_img_842307_19436a7e_1773583840972_sc.jpg?tenant=sc&referrer=pwa-sharechat-service&f=972_sc.jpg "maths - Reasoning Complete Rules Mathemarical 1. STATEMENT २. SIMPLE & COMPOUND STATEMENTS Simple sfafemenf A sfqfement is & senfence thqt is cannof be broken false buf nof both true further eifher Or using formed Compound sfafemenf Examples: logical connecfives 2 + 3 = 5 (True) is an even number (False) 4. TRUTH VALUES TABLE (SUMMARY) pAq pVq ٥»٩ p<q ३. LOGICAL CONNECTIVES =٥ p FTF (a) Negation (-p) = T If p is True; -p is false F If p is false -p is frue. ٤ T F F T ٤ (b) Conjunction (p^q) Read as p AND q 5. TAUTOLOGY & CONTRADICTION True only when both p and are Tautology always frue True dlways false Contradiction (c) Disjunction (p ٧و) Read as p OR False only when both p and 6. CONVERSE INVERSE & CONTRAPOSITIVE are false For p -> ৭: Converse - q p (d) Implication (p > q) Inverse 7p 7q [f P, then q Read as Confraposifive > -q 7p 2 False only when p is True ond ৭ contrapositive] p =0 is fdlse; (e) Biconditional (p < 9) 8. QUANTIFIERS p if qnd only if q\" Read as (a) Universal Quanfifier 7 VALID & INVALID ARGUMENTS for all Meaning: An argument is valid if the conclusion (b) Existential Quantifier (3) logicqlly follows from premises.. Meaningः there exists 9. NEGATION OF STATEMENTS WITH 0. IMPORTANT POINTS QUANTIFIERS definife A statement must havel truth value -(Vx p(x)) = Jx -p(x) Mathematical reasoning is logic-based} -(3x p(x)) = Vx -p(x) not cdlculdtion-bused verify compound help Trufh tqbles statements Reasoning Complete Rules Mathemarical 1. STATEMENT २. SIMPLE & COMPOUND STATEMENTS Simple sfafemenf A sfqfement is & senfence thqt is cannof be broken false buf nof both true further eifher Or using formed Compound sfafemenf Examples: logical connecfives 2 + 3 = 5 (True) is an even number (False) 4. TRUTH VALUES TABLE (SUMMARY) pAq pVq ٥»٩ p<q ३. LOGICAL CONNECTIVES =٥ p FTF (a) Negation (-p) = T If p is True; -p is false F If p is false -p is frue. ٤ T F F T ٤ (b) Conjunction (p^q) Read as p AND q 5. TAUTOLOGY & CONTRADICTION True only when both p and are Tautology always frue True dlways false Contradiction (c) Disjunction (p ٧و) Read as p OR False only when both p and 6. CONVERSE INVERSE & CONTRAPOSITIVE are false For p -> ৭: Converse - q p (d) Implication (p > q) Inverse 7p 7q [f P, then q Read as Confraposifive > -q 7p 2 False only when p is True ond ৭ contrapositive] p =0 is fdlse; (e) Biconditional (p < 9) 8. QUANTIFIERS p if qnd only if q\" Read as (a) Universal Quanfifier 7 VALID & INVALID ARGUMENTS for all Meaning: An argument is valid if the conclusion (b) Existential Quantifier (3) logicqlly follows from premises.. Meaningः there exists 9. NEGATION OF STATEMENTS WITH 0. IMPORTANT POINTS QUANTIFIERS definife A statement must havel truth value -(Vx p(x)) = Jx -p(x) Mathematical reasoning is logic-based} -(3x p(x)) = Vx -p(x) not cdlculdtion-bused verify compound help Trufh tqbles statements - ShareChat")