![Page 1: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/1.jpg)
BPA 12203MATHEMATICS FOR MANAGEMENT
Chapter 2
LOGIC
Dr Chandra
Mathematics for Management: Logic
![Page 2: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/2.jpg)
Terminology
Definition
Logic is the study of arguments.
An argument is a sequence of statements in which one in-tended as a conclusion and the others, the premises, are intendedto prove or at least provide some evidence for the conclusion.
Example
Mathematics for Management: Logic
![Page 3: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/3.jpg)
Terminology
Definition
Logic is the study of arguments.
An argument is a sequence of statements in which one in-tended as a conclusion and the others, the premises, are intendedto prove or at least provide some evidence for the conclusion.
Example
Mathematics for Management: Logic
![Page 4: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/4.jpg)
Example*
Mathematics for Management: Logic
![Page 5: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/5.jpg)
Propositions (or Statement)
Definition
A proposition or statement is a declarative sentence that can beclassified as either true or false, but not both.
Note that commands, requests, questions and exclamationsare not classified as propositions.
Mathematics for Management: Logic
![Page 6: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/6.jpg)
Example*: Which of the following are propositions? Then,determine whether they are true or false.
Mathematics for Management: Logic
![Page 7: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/7.jpg)
Simple statement
Is a single sentence that does not contain any other statement as apart.
Lower - case letters such as p, q, r . . . as symbols for simplestatements.
Example*
p: Kuala Lumpur is the capital of Malaysia
q: Malaysia is a middle east country.
Mathematics for Management: Logic
![Page 8: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/8.jpg)
Simple statement
Is a single sentence that does not contain any other statement as apart.
Lower - case letters such as p, q, r . . . as symbols for simplestatements.
Example*
p: Kuala Lumpur is the capital of Malaysia
q: Malaysia is a middle east country.
Mathematics for Management: Logic
![Page 9: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/9.jpg)
Compound statement
Is a sentence with two or more simple statements as parts or whatwe call components.
Example*
Kuala Lumpur is the capital of Malaysia and Malaysia is aMiddle East country.
Mathematics for Management: Logic
![Page 10: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/10.jpg)
Compound statement
Is a sentence with two or more simple statements as parts or whatwe call components.
Example*
Kuala Lumpur is the capital of Malaysia and Malaysia is aMiddle East country.
Mathematics for Management: Logic
![Page 11: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/11.jpg)
Connectives*
Definition
An operator (or connective) joins simple statements into compoundstatement.
Mathematics for Management: Logic
![Page 12: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/12.jpg)
Connectives*
Definition
An operator (or connective) joins simple statements into compoundstatement.
Mathematics for Management: Logic
![Page 13: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/13.jpg)
Conjunction.*
A statement of the form ” p and q”.
Represented symbolically by ”p ∧ q”.
p ∧ q is true, if both p and q are true.
Otherwise, it is false.
Negation.*
A statement of the form ”not p”.
Represented symbolically by ”∼ p”.
The proposition ∼ p is true if p false and vice versa.
Mathematics for Management: Logic
![Page 14: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/14.jpg)
Conjunction.*
A statement of the form ” p and q”.
Represented symbolically by ”p ∧ q”.
p ∧ q is true, if both p and q are true.
Otherwise, it is false.
Negation.*
A statement of the form ”not p”.
Represented symbolically by ”∼ p”.
The proposition ∼ p is true if p false and vice versa.
Mathematics for Management: Logic
![Page 15: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/15.jpg)
Conjunction.*
A statement of the form ” p and q”.
Represented symbolically by ”p ∧ q”.
p ∧ q is true, if both p and q are true.
Otherwise, it is false.
Negation.*
A statement of the form ”not p”.
Represented symbolically by ”∼ p”.
The proposition ∼ p is true if p false and vice versa.
Mathematics for Management: Logic
![Page 16: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/16.jpg)
Conjunction.*
A statement of the form ” p and q”.
Represented symbolically by ”p ∧ q”.
p ∧ q is true, if both p and q are true.
Otherwise, it is false.
Negation.*
A statement of the form ”not p”.
Represented symbolically by ”∼ p”.
The proposition ∼ p is true if p false and vice versa.
Mathematics for Management: Logic
![Page 17: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/17.jpg)
Conjunction.*
A statement of the form ” p and q”.
Represented symbolically by ”p ∧ q”.
p ∧ q is true, if both p and q are true.
Otherwise, it is false.
Negation.*
A statement of the form ”not p”.
Represented symbolically by ”∼ p”.
The proposition ∼ p is true if p false and vice versa.
Mathematics for Management: Logic
![Page 18: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/18.jpg)
Conjunction.*
A statement of the form ” p and q”.
Represented symbolically by ”p ∧ q”.
p ∧ q is true, if both p and q are true.
Otherwise, it is false.
Negation.*
A statement of the form ”not p”.
Represented symbolically by ”∼ p”.
The proposition ∼ p is true if p false and vice versa.
Mathematics for Management: Logic
![Page 19: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/19.jpg)
Conjunction.*
A statement of the form ” p and q”.
Represented symbolically by ”p ∧ q”.
p ∧ q is true, if both p and q are true.
Otherwise, it is false.
Negation.*
A statement of the form ”not p”.
Represented symbolically by ”∼ p”.
The proposition ∼ p is true if p false and vice versa.
Mathematics for Management: Logic
![Page 20: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/20.jpg)
Inclusive disjunction. *
A statement of the form ” p or q”.
Represented symbolically by ”p ∨ q”.
p ∨ q is false, if both p and q are false.
In all other cases, it is true.
The word ”or” means ”one or the other, or both.”
Exclusive disjunction. *
A statement of the form ”either p or q”.
Represented symbolically by ”p Y q”.
p Y q is true, if exactly one of the proposition p or q is true.
The word ”either. . .or” means ”one or the other, but notboth”.
Mathematics for Management: Logic
![Page 21: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/21.jpg)
Inclusive disjunction. *
A statement of the form ” p or q”.
Represented symbolically by ”p ∨ q”.
p ∨ q is false, if both p and q are false.
In all other cases, it is true.
The word ”or” means ”one or the other, or both.”
Exclusive disjunction. *
A statement of the form ”either p or q”.
Represented symbolically by ”p Y q”.
p Y q is true, if exactly one of the proposition p or q is true.
The word ”either. . .or” means ”one or the other, but notboth”.
Mathematics for Management: Logic
![Page 22: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/22.jpg)
Inclusive disjunction. *
A statement of the form ” p or q”.
Represented symbolically by ”p ∨ q”.
p ∨ q is false, if both p and q are false.
In all other cases, it is true.
The word ”or” means ”one or the other, or both.”
Exclusive disjunction. *
A statement of the form ”either p or q”.
Represented symbolically by ”p Y q”.
p Y q is true, if exactly one of the proposition p or q is true.
The word ”either. . .or” means ”one or the other, but notboth”.
Mathematics for Management: Logic
![Page 23: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/23.jpg)
Inclusive disjunction. *
A statement of the form ” p or q”.
Represented symbolically by ”p ∨ q”.
p ∨ q is false, if both p and q are false.
In all other cases, it is true.
The word ”or” means ”one or the other, or both.”
Exclusive disjunction. *
A statement of the form ”either p or q”.
Represented symbolically by ”p Y q”.
p Y q is true, if exactly one of the proposition p or q is true.
The word ”either. . .or” means ”one or the other, but notboth”.
Mathematics for Management: Logic
![Page 24: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/24.jpg)
Inclusive disjunction. *
A statement of the form ” p or q”.
Represented symbolically by ”p ∨ q”.
p ∨ q is false, if both p and q are false.
In all other cases, it is true.
The word ”or” means ”one or the other, or both.”
Exclusive disjunction. *
A statement of the form ”either p or q”.
Represented symbolically by ”p Y q”.
p Y q is true, if exactly one of the proposition p or q is true.
The word ”either. . .or” means ”one or the other, but notboth”.
Mathematics for Management: Logic
![Page 25: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/25.jpg)
Inclusive disjunction. *
A statement of the form ” p or q”.
Represented symbolically by ”p ∨ q”.
p ∨ q is false, if both p and q are false.
In all other cases, it is true.
The word ”or” means ”one or the other, or both.”
Exclusive disjunction. *
A statement of the form ”either p or q”.
Represented symbolically by ”p Y q”.
p Y q is true, if exactly one of the proposition p or q is true.
The word ”either. . .or” means ”one or the other, but notboth”.
Mathematics for Management: Logic
![Page 26: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/26.jpg)
Inclusive disjunction. *
A statement of the form ” p or q”.
Represented symbolically by ”p ∨ q”.
p ∨ q is false, if both p and q are false.
In all other cases, it is true.
The word ”or” means ”one or the other, or both.”
Exclusive disjunction. *
A statement of the form ”either p or q”.
Represented symbolically by ”p Y q”.
p Y q is true, if exactly one of the proposition p or q is true.
The word ”either. . .or” means ”one or the other, but notboth”.
Mathematics for Management: Logic
![Page 27: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/27.jpg)
Inclusive disjunction. *
A statement of the form ” p or q”.
Represented symbolically by ”p ∨ q”.
p ∨ q is false, if both p and q are false.
In all other cases, it is true.
The word ”or” means ”one or the other, or both.”
Exclusive disjunction. *
A statement of the form ”either p or q”.
Represented symbolically by ”p Y q”.
p Y q is true, if exactly one of the proposition p or q is true.
The word ”either. . .or” means ”one or the other, but notboth”.
Mathematics for Management: Logic
![Page 28: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/28.jpg)
Inclusive disjunction. *
A statement of the form ” p or q”.
Represented symbolically by ”p ∨ q”.
p ∨ q is false, if both p and q are false.
In all other cases, it is true.
The word ”or” means ”one or the other, or both.”
Exclusive disjunction. *
A statement of the form ”either p or q”.
Represented symbolically by ”p Y q”.
p Y q is true, if exactly one of the proposition p or q is true.
The word ”either. . .or” means ”one or the other, but notboth”.
Mathematics for Management: Logic
![Page 29: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/29.jpg)
Conditional. *
A statement of the form ”if p then q” or ”p implies q”.
Represented symbolically by ”p⇒ q”.
A conditional / implication statement is false if p is true and qis false.
In other cases, a conditional statement is true.
Biconditional. *
A statement of the form
• ”p is necesssary and sufficient for q”.• ”p implies q and q implies p”.• ”p if and only if (iff) q”.
Represented symbolically by ”p⇔ q”.
Mathematics for Management: Logic
![Page 30: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/30.jpg)
Conditional. *
A statement of the form ”if p then q” or ”p implies q”.
Represented symbolically by ”p⇒ q”.
A conditional / implication statement is false if p is true and qis false.
In other cases, a conditional statement is true.
Biconditional. *
A statement of the form
• ”p is necesssary and sufficient for q”.• ”p implies q and q implies p”.• ”p if and only if (iff) q”.
Represented symbolically by ”p⇔ q”.
Mathematics for Management: Logic
![Page 31: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/31.jpg)
Conditional. *
A statement of the form ”if p then q” or ”p implies q”.
Represented symbolically by ”p⇒ q”.
A conditional / implication statement is false if p is true and qis false.
In other cases, a conditional statement is true.
Biconditional. *
A statement of the form
• ”p is necesssary and sufficient for q”.• ”p implies q and q implies p”.• ”p if and only if (iff) q”.
Represented symbolically by ”p⇔ q”.
Mathematics for Management: Logic
![Page 32: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/32.jpg)
Conditional. *
A statement of the form ”if p then q” or ”p implies q”.
Represented symbolically by ”p⇒ q”.
A conditional / implication statement is false if p is true and qis false.
In other cases, a conditional statement is true.
Biconditional. *
A statement of the form
• ”p is necesssary and sufficient for q”.• ”p implies q and q implies p”.• ”p if and only if (iff) q”.
Represented symbolically by ”p⇔ q”.
Mathematics for Management: Logic
![Page 33: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/33.jpg)
Conditional. *
A statement of the form ”if p then q” or ”p implies q”.
Represented symbolically by ”p⇒ q”.
A conditional / implication statement is false if p is true and qis false.
In other cases, a conditional statement is true.
Biconditional. *
A statement of the form
• ”p is necesssary and sufficient for q”.
• ”p implies q and q implies p”.• ”p if and only if (iff) q”.
Represented symbolically by ”p⇔ q”.
Mathematics for Management: Logic
![Page 34: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/34.jpg)
Conditional. *
A statement of the form ”if p then q” or ”p implies q”.
Represented symbolically by ”p⇒ q”.
A conditional / implication statement is false if p is true and qis false.
In other cases, a conditional statement is true.
Biconditional. *
A statement of the form
• ”p is necesssary and sufficient for q”.• ”p implies q and q implies p”.
• ”p if and only if (iff) q”.
Represented symbolically by ”p⇔ q”.
Mathematics for Management: Logic
![Page 35: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/35.jpg)
Conditional. *
A statement of the form ”if p then q” or ”p implies q”.
Represented symbolically by ”p⇒ q”.
A conditional / implication statement is false if p is true and qis false.
In other cases, a conditional statement is true.
Biconditional. *
A statement of the form
• ”p is necesssary and sufficient for q”.• ”p implies q and q implies p”.• ”p if and only if (iff) q”.
Represented symbolically by ”p⇔ q”.
Mathematics for Management: Logic
![Page 36: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/36.jpg)
Conditional. *
A statement of the form ”if p then q” or ”p implies q”.
Represented symbolically by ”p⇒ q”.
A conditional / implication statement is false if p is true and qis false.
In other cases, a conditional statement is true.
Biconditional. *
A statement of the form
• ”p is necesssary and sufficient for q”.• ”p implies q and q implies p”.• ”p if and only if (iff) q”.
Represented symbolically by ”p⇔ q”.
Mathematics for Management: Logic
![Page 37: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/37.jpg)
Example*
Mathematics for Management: Logic
![Page 38: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/38.jpg)
Truth table
Definition
A truth table is a complete list of the possible truth values of astatement.
”T” for ”True” and ”F” for ”False”.
One proposition*
Mathematics for Management: Logic
![Page 39: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/39.jpg)
Truth table
Definition
A truth table is a complete list of the possible truth values of astatement.
”T” for ”True” and ”F” for ”False”.
One proposition*
Mathematics for Management: Logic
![Page 40: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/40.jpg)
Two propositions*
Mathematics for Management: Logic
![Page 41: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/41.jpg)
Two propositions*
Mathematics for Management: Logic
![Page 42: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/42.jpg)
Three propositions*
Mathematics for Management: Logic
![Page 43: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/43.jpg)
Three propositions*
Mathematics for Management: Logic
![Page 44: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/44.jpg)
Basic truth tables
Mathematics for Management: Logic
![Page 45: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/45.jpg)
Example: Complete the truth table*
p q p ∧ q (p ∧ q) ∨ p ∼ q ∼ q ⇒ p (∼ q ⇒ p)⇔ [(p ∧ q) ∨ p]
T T
T F
F T
F F
Mathematics for Management: Logic
![Page 46: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/46.jpg)
Example: Complete the truth table*
p q p ∧ q (p ∧ q) ∨ p ∼ q ∼ q ⇒ p (∼ q ⇒ p)⇔ [(p ∧ q) ∨ p]
T T T T F T T
T F F T T T T
F T F F F T F
F F F F T F T
Mathematics for Management: Logic
![Page 47: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/47.jpg)
Tautology
If the statement is always TRUE, then this is called a tautology.
Example*: Show that the proposition (p ∧ q)⇒ p is atautology.
Mathematics for Management: Logic
![Page 48: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/48.jpg)
Tautology
If the statement is always TRUE, then this is called a tautology.
Example*: Show that the proposition (p ∧ q)⇒ p is atautology.
Mathematics for Management: Logic
![Page 49: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/49.jpg)
Contradiction
If the statement is always FALSE, then this is called a contradiction.
Example*: Show that the proposition (p ∧ q)∧ ∼ (p ∧ q) is acontradiction.
Mathematics for Management: Logic
![Page 50: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/50.jpg)
Contradiction
If the statement is always FALSE, then this is called a contradiction.
Example*: Show that the proposition (p ∧ q)∧ ∼ (p ∧ q) is acontradiction.
Mathematics for Management: Logic
![Page 51: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/51.jpg)
Logical equivalence
If two propositions p and q have the same truth values in everypossible case, the propositions are called logically equivalent.
This relationship is denoted by p ≡ q.
Example*: Show that the proposition ∼ (p ∧ q) ≡∼ p∨ ∼ q.
Mathematics for Management: Logic
![Page 52: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/52.jpg)
Logical equivalence
If two propositions p and q have the same truth values in everypossible case, the propositions are called logically equivalent.
This relationship is denoted by p ≡ q.
Example*: Show that the proposition ∼ (p ∧ q) ≡∼ p∨ ∼ q.
Mathematics for Management: Logic
![Page 53: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/53.jpg)
Converse *p⇒ qconverse
q ⇒ p
Contrapositive *p⇒ qcontrapositive∼ q ⇒∼ p
Inverse *p⇒ qinverse∼ p⇒∼ q
Mathematics for Management: Logic
![Page 54: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/54.jpg)
Converse *p⇒ qconverseq ⇒ p
Contrapositive *p⇒ qcontrapositive∼ q ⇒∼ p
Inverse *p⇒ qinverse∼ p⇒∼ q
Mathematics for Management: Logic
![Page 55: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/55.jpg)
Converse *p⇒ qconverseq ⇒ p
Contrapositive *p⇒ qcontrapositive
∼ q ⇒∼ p
Inverse *p⇒ qinverse∼ p⇒∼ q
Mathematics for Management: Logic
![Page 56: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/56.jpg)
Converse *p⇒ qconverseq ⇒ p
Contrapositive *p⇒ qcontrapositive∼ q ⇒∼ p
Inverse *p⇒ qinverse∼ p⇒∼ q
Mathematics for Management: Logic
![Page 57: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/57.jpg)
Converse *p⇒ qconverseq ⇒ p
Contrapositive *p⇒ qcontrapositive∼ q ⇒∼ p
Inverse *p⇒ qinverse
∼ p⇒∼ q
Mathematics for Management: Logic
![Page 58: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/58.jpg)
Converse *p⇒ qconverseq ⇒ p
Contrapositive *p⇒ qcontrapositive∼ q ⇒∼ p
Inverse *p⇒ qinverse∼ p⇒∼ q
Mathematics for Management: Logic
![Page 59: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/59.jpg)
Example: Consider the statements
p: You are a hardworking student.
q: You will get good marks in examination.
converse*
If you get good marks in examination, then you are ahardworking student.
contrapositive *
If you didn’t get good marks in examination, then you are nota hardworking student .
inverse *
If you are not a hardworking student, then you will not getgood marks in examination .
Mathematics for Management: Logic
![Page 60: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/60.jpg)
Example: Consider the statements
p: You are a hardworking student.
q: You will get good marks in examination.
converse*
If you get good marks in examination, then you are ahardworking student.
contrapositive *
If you didn’t get good marks in examination, then you are nota hardworking student .
inverse *
If you are not a hardworking student, then you will not getgood marks in examination .
Mathematics for Management: Logic
![Page 61: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/61.jpg)
Example: Consider the statements
p: You are a hardworking student.
q: You will get good marks in examination.
converse*
If you get good marks in examination, then you are ahardworking student.
contrapositive *
If you didn’t get good marks in examination, then you are nota hardworking student .
inverse *
If you are not a hardworking student, then you will not getgood marks in examination .
Mathematics for Management: Logic
![Page 62: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/62.jpg)
Example: Consider the statements
p: You are a hardworking student.
q: You will get good marks in examination.
converse*
If you get good marks in examination, then you are ahardworking student.
contrapositive *
If you didn’t get good marks in examination, then you are nota hardworking student .
inverse *
If you are not a hardworking student, then you will not getgood marks in examination .
Mathematics for Management: Logic
![Page 63: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/63.jpg)
Example: Consider the statements
p: You are a hardworking student.
q: You will get good marks in examination.
converse*
If you get good marks in examination, then you are ahardworking student.
contrapositive *
If you didn’t get good marks in examination, then you are nota hardworking student .
inverse *
If you are not a hardworking student, then you will not getgood marks in examination .
Mathematics for Management: Logic
![Page 64: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/64.jpg)
Example: Consider the statements
p: You are a hardworking student.
q: You will get good marks in examination.
converse*
If you get good marks in examination, then you are ahardworking student.
contrapositive *
If you didn’t get good marks in examination, then you are nota hardworking student .
inverse *
If you are not a hardworking student, then you will not getgood marks in examination .
Mathematics for Management: Logic
![Page 65: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/65.jpg)
Example: Consider the statements
p: You are a hardworking student.
q: You will get good marks in examination.
converse*
If you get good marks in examination, then you are ahardworking student.
contrapositive *
If you didn’t get good marks in examination, then you are nota hardworking student .
inverse *
If you are not a hardworking student, then you will not getgood marks in examination .
Mathematics for Management: Logic
![Page 66: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/66.jpg)
Example: Truth table*
p q p⇒ q q ⇒ p ∼ p ∼ q ∼ q ⇒∼ p ∼ p⇒∼ q
T T
T F
F T
F F
Mathematics for Management: Logic
![Page 67: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/67.jpg)
Example: Truth table*
p q p⇒ q q ⇒ p ∼ p ∼ q ∼ q ⇒∼ p ∼ p⇒∼ q
T T T T F F T T
T F F T F T F T
F T T F T F T F
F F T T T T T T
Conclusion: p⇒ q ≡ ∼ q ⇒∼ p and q ⇒ p ≡ ∼ p⇒∼ q
Mathematics for Management: Logic
![Page 68: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/68.jpg)
Example: Truth table*
p q p⇒ q q ⇒ p ∼ p ∼ q ∼ q ⇒∼ p ∼ p⇒∼ q
T T T T F F T T
T F F T F T F T
F T T F T F T F
F F T T T T T T
Conclusion: p⇒ q
≡ ∼ q ⇒∼ p and q ⇒ p ≡ ∼ p⇒∼ q
Mathematics for Management: Logic
![Page 69: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/69.jpg)
Example: Truth table*
p q p⇒ q q ⇒ p ∼ p ∼ q ∼ q ⇒∼ p ∼ p⇒∼ q
T T T T F F T T
T F F T F T F T
F T T F T F T F
F F T T T T T T
Conclusion: p⇒ q ≡
∼ q ⇒∼ p and q ⇒ p ≡ ∼ p⇒∼ q
Mathematics for Management: Logic
![Page 70: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/70.jpg)
Example: Truth table*
p q p⇒ q q ⇒ p ∼ p ∼ q ∼ q ⇒∼ p ∼ p⇒∼ q
T T T T F F T T
T F F T F T F T
F T T F T F T F
F F T T T T T T
Conclusion: p⇒ q ≡ ∼ q ⇒∼ p
and q ⇒ p ≡ ∼ p⇒∼ q
Mathematics for Management: Logic
![Page 71: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/71.jpg)
Example: Truth table*
p q p⇒ q q ⇒ p ∼ p ∼ q ∼ q ⇒∼ p ∼ p⇒∼ q
T T T T F F T T
T F F T F T F T
F T T F T F T F
F F T T T T T T
Conclusion: p⇒ q ≡ ∼ q ⇒∼ p and
q ⇒ p ≡ ∼ p⇒∼ q
Mathematics for Management: Logic
![Page 72: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/72.jpg)
Example: Truth table*
p q p⇒ q q ⇒ p ∼ p ∼ q ∼ q ⇒∼ p ∼ p⇒∼ q
T T T T F F T T
T F F T F T F T
F T T F T F T F
F F T T T T T T
Conclusion: p⇒ q ≡ ∼ q ⇒∼ p and q ⇒ p
≡ ∼ p⇒∼ q
Mathematics for Management: Logic
![Page 73: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/73.jpg)
Example: Truth table*
p q p⇒ q q ⇒ p ∼ p ∼ q ∼ q ⇒∼ p ∼ p⇒∼ q
T T T T F F T T
T F F T F T F T
F T T F T F T F
F F T T T T T T
Conclusion: p⇒ q ≡ ∼ q ⇒∼ p and q ⇒ p ≡
∼ p⇒∼ q
Mathematics for Management: Logic
![Page 74: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/74.jpg)
Example: Truth table*
p q p⇒ q q ⇒ p ∼ p ∼ q ∼ q ⇒∼ p ∼ p⇒∼ q
T T T T F F T T
T F F T F T F T
F T T F T F T F
F F T T T T T T
Conclusion: p⇒ q ≡ ∼ q ⇒∼ p and q ⇒ p ≡ ∼ p⇒∼ q
Mathematics for Management: Logic
![Page 75: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/75.jpg)
Validity of argument
Definition
A sequence of steps that prove or disprove a statement.
Five steps:
1. Understand the situation.
2. Denote propositions or statements as logical symbols.
3. Write all the mathematical symbols by following the sequence.
4. Construct the truth table.
5. Determine the validity of arguments.
Mathematics for Management: Logic
![Page 76: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/76.jpg)
Validity of argument
Definition
A sequence of steps that prove or disprove a statement.
Five steps:
1. Understand the situation.
2. Denote propositions or statements as logical symbols.
3. Write all the mathematical symbols by following the sequence.
4. Construct the truth table.
5. Determine the validity of arguments.
Mathematics for Management: Logic
![Page 77: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/77.jpg)
Validity of argument
Definition
A sequence of steps that prove or disprove a statement.
Five steps:
1. Understand the situation.
2. Denote propositions or statements as logical symbols.
3. Write all the mathematical symbols by following the sequence.
4. Construct the truth table.
5. Determine the validity of arguments.
Mathematics for Management: Logic
![Page 78: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/78.jpg)
Validity of argument
Definition
A sequence of steps that prove or disprove a statement.
Five steps:
1. Understand the situation.
2. Denote propositions or statements as logical symbols.
3. Write all the mathematical symbols by following the sequence.
4. Construct the truth table.
5. Determine the validity of arguments.
Mathematics for Management: Logic
![Page 79: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/79.jpg)
Validity of argument
Definition
A sequence of steps that prove or disprove a statement.
Five steps:
1. Understand the situation.
2. Denote propositions or statements as logical symbols.
3. Write all the mathematical symbols by following the sequence.
4. Construct the truth table.
5. Determine the validity of arguments.
Mathematics for Management: Logic
![Page 80: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/80.jpg)
Validity of argument
Definition
A sequence of steps that prove or disprove a statement.
Five steps:
1. Understand the situation.
2. Denote propositions or statements as logical symbols.
3. Write all the mathematical symbols by following the sequence.
4. Construct the truth table.
5. Determine the validity of arguments.
Mathematics for Management: Logic
![Page 81: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/81.jpg)
Example 1: Determine the validity of the argument below.
Suppose it is true that either Shalin broke the vase or Shalin waspunished, but not both and Shalin was not punished. Prove thatShalin broke the vase.
1. Understand the situation.
p: Shalin broke the vase.
q: Shalin was punished.
Mathematics for Management: Logic
![Page 82: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/82.jpg)
Example 1: Determine the validity of the argument below.
Suppose it is true that either Shalin broke the vase or Shalin waspunished, but not both and Shalin was not punished. Prove thatShalin broke the vase.
1. Understand the situation.
p: Shalin broke the vase.
q: Shalin was punished.
Mathematics for Management: Logic
![Page 83: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/83.jpg)
2. Denote propositions or statements as logical symbols.
Mathematics for Management: Logic
![Page 84: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/84.jpg)
3. Write all the mathematical symbols by following thesequence.
Mathematics for Management: Logic
![Page 85: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/85.jpg)
4. Construct the truth table.
5. Determine the validity of arguments.Since we have all TRUE (tautology), the argument is valid.
Mathematics for Management: Logic
![Page 86: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/86.jpg)
4. Construct the truth table.
5. Determine the validity of arguments.Since we have all TRUE (tautology), the argument is valid.
Mathematics for Management: Logic
![Page 87: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/87.jpg)
Example 2: Determine the validity of the argument below.
Suppose it is true that it is raining and if it is hot, then it is notraining and if it is not hot, then I cannot go fishing. Prove that Icannot go fishing.
1. Understand the situation.
p: It is raining.
q: It is hot.
r: I can go fishing.
Mathematics for Management: Logic
![Page 88: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/88.jpg)
Example 2: Determine the validity of the argument below.
Suppose it is true that it is raining and if it is hot, then it is notraining and if it is not hot, then I cannot go fishing. Prove that Icannot go fishing.
1. Understand the situation.
p: It is raining.
q: It is hot.
r: I can go fishing.
Mathematics for Management: Logic
![Page 89: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/89.jpg)
2. Denote propositions or statements as logical symbols.
Mathematics for Management: Logic
![Page 90: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/90.jpg)
3. Write all the mathematical symbols by following thesequence.
Mathematics for Management: Logic
![Page 91: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/91.jpg)
4. Construct the truth table.
5. Determine the validity of arguments.Since we have all TRUE (tautology), the argument is valid.
Mathematics for Management: Logic
![Page 92: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/92.jpg)
4. Construct the truth table.
5. Determine the validity of arguments.Since we have all TRUE (tautology), the argument is valid.
Mathematics for Management: Logic
![Page 93: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/93.jpg)
Example 3: Determine the validity of the argument below.
If I have finished my meal, then I will go to the book store.If I go to the book store, then my brother will also go to the book store.My brother did not go to the book store, so I haven’t finished mymeal.
1. Understand the situation.
p: I have finished my meal.
q: I will go to the book store.
r: My brother will also go to the book store.
Mathematics for Management: Logic
![Page 94: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/94.jpg)
Example 3: Determine the validity of the argument below.
If I have finished my meal, then I will go to the book store.If I go to the book store, then my brother will also go to the book store.My brother did not go to the book store, so I haven’t finished mymeal.
1. Understand the situation.
p: I have finished my meal.
q: I will go to the book store.
r: My brother will also go to the book store.
Mathematics for Management: Logic
![Page 95: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/95.jpg)
2. Denote propositions or statements as logical symbols.
Mathematics for Management: Logic
![Page 96: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/96.jpg)
3. Write all the mathematical symbols by following thesequence.
Mathematics for Management: Logic
![Page 97: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/97.jpg)
4. Construct the truth table.
5. Determine the validity of arguments.Since we have all TRUE (tautology), the argument is valid.
Mathematics for Management: Logic
![Page 98: BPA 12203 MATHEMATICS FOR MANAGEMENT Chapter 2](https://reader031.vdocuments.mx/reader031/viewer/2022020701/61f716c667a52e20ca06142f/html5/thumbnails/98.jpg)
4. Construct the truth table.
5. Determine the validity of arguments.Since we have all TRUE (tautology), the argument is valid.
Mathematics for Management: Logic