Discrete Mathematics 2002 Lecture 13, 20-August-2002

Arguments in Logic
• Consider the following argument:
If a person does arithmetic well, they will
manage their finances well. I cannot do
arithmetic well. Therefore, I cannot
manage my finances well.
• The argument consists of some premises (the
first 2 sentences) & a conclusion (the last
sentence) which is supposed to be a
consequence of the premises
• So the argument has the logical expression
(P1 ∧ P2) → Q
1

Validity of an Argument
• In (P1 ∧ P2) → Q, P1 and P2 are the premises
and Q is the conclusion
• If the argument is valid, the conclusion should
be true whenever all the premises are true
• This means that if P1 ∧ P2 is true, then Q must
also be true
• Thus the argument is valid provided that
(P1 ∧ P2) → Q is a tautology
2

Testing the Validity of an Argument

• Let’s test the validity of the argument:
If a person does arithmetic well, they will
manage their finances well. I cannot do
arithmetic well. Therefore, I cannot manage
my finances well.
• Let p = ‘I do arithmetic well’, and q = ‘I
manage my finances well’
• Then P1 ≡ p → q, P2 ≡ ¬p & Q ≡ ¬q
• Is [(p → q) ∧ ¬p] → ¬q a tautology?
• To answer this, we’ll use a truth table, though
the laws of logic could also be used
3

1
Discrete Mathematics 2002 Lecture 13, 20-August-2002

Truth Table for the Argument

P1 P2 P1 ∧ P2 Q (P1 ∧ P2) → Q
p q p → q ¬ p (p → q)∧¬ p ¬ q [(p → q)∧¬ p]
→¬q
T T T F F F T
T F F F F T T
F T T T T F F
F F T T T T T
4

Conclusions from the Truth Table

• By the truth table, (P1 ∧ P2) → Q is not
always true (i.e. it’s not a tautology), so the
original argument is not valid
• In fact, row 3 of the truth table tells us why
the argument is not valid –
If I don’t do arithmetic well, but manage my
finances well, the premises of the argument
are satisfied, but the conclusion is not
satisfied
5

Another Example
• Here is another argument:
If a person does arithmetic well, they will
manage their finances well. I cannot
manage my finances well. Therefore, I
cannot do arithmetic well.
• Exercise: Write a logical expression that
represents this argument
• Exercise: Use a truth table to determine
whether or not the argument is valid
6

2
Discrete Mathematics 2002 Lecture 13, 20-August-2002

An Argument with 3 Variables

• Consider the argument:
If I obtain a degree, then I will be rich. If
I don’t obtain a degree, then I will be
happy. Therefore, I will be rich or happy.
• Is this a valid argument?
• Let p = ‘I will obtain a degree’, q = ‘I will
be rich’, r = ‘I will be happy’
• Then the argument is represented by
[(p → q) ∧ (¬p → r)] → (q ∨ r)
7

Testing the Argument’s Validity

• Is [(p → q) ∧ (¬p → r)] → (q ∨ r) a tautology?
• We could use a truth table, though it would have
8 rows (because there are 3 variables)
• Alternately, we could use the laws of logic
• We’ll use the latter approach
• After some effort, it follows that
[(p → q) ∧ (¬p → r)] → (q ∨ r) ≡ T
• Thus the expression is a tautology, which means
that the argument is valid
8

Law(s) of Logic Name

p ↔ q ≡ (p → q) ∧ (q → p) equivalence
p → q ≡ ¬p ∨ q implication
¬¬ p ≡ p double negation
p∧p≡p p∨p≡p idempotent
p∧q≡q∧p p∨q≡q∨p commutative
(p ∧ q) ∧ r ≡ p ∧ (q ∧ r) (p ∨ q) ∨ r ≡ p ∨ (q ∨ r) associative
p ∧ (q ∨ r) ≡ p ∨ (q ∧ r) ≡
distributive
(p ∧ q) ∨ (p ∧ r) (p ∨ q) ∧ (p ∨ r)
¬ (p ∧ q) ≡ ¬ p ∨ ¬ q ¬ (p ∨ q) ≡ ¬ p ∧ ¬ q de Morgan’s
p∧T≡p p∨F≡p identity
p∧F≡F p∨T≡T annihilation
p ∧ ¬p ≡ F p ∨ ¬p ≡ T inverse
p ∧ (p ∨ q) ≡ p p ∨ (p ∧ q) ≡ p absorption

3
Discrete Mathematics 2002 Lecture 13, 20-August-2002

Discrete Maths Test 1

• 45-minute test in the normal lecture time (9am)
on Friday 30 August
• Covers the work up to the end of today’s lecture
(i.e. to the end of Section 4.6 of the text),
including associated tutorial work
• 10 short questions, each worth 5 marks
• Last year’s Test 1 is a guide to the format &
standard – it’s available (as are solutions) from
the Discrete Maths Resources web page
10

Test 1 (continued)
• You are not permitted to bring anything to the
test apart from writing implements – in
particular, no calculator or sheet(s) of notes are
allowed
• You will be supplied with a page containing a
truth table for the basic logical connectives and
a list of the principal laws of logic – the page is
available from the Discrete Maths Resources
web page if you wish to see it before the test
11

Test 1 (continued)
• In all questions, you should include appropriate
explanations with your answers, and show any
working that was required
Questions are not marked just on whether the
answer is right or wrong!
• Test 1 counts 20% to the final assessment in
Discrete Maths
• Marked tests will be returned in tutorials soon
after the test – on the test paper you will need to
indicate the day & time of your tute group
12