LECTURE 8 Flashcards

1
Q

Every statement has a truth value; what is it?

A

it is either true or false

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Whats a The truth value of a true statement

A

“true

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Whats a The truth value of a false statement

A

false

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

do questions and exclamations have truth value?

A

They dont because they are neither true nor false.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Whats a conjunction

A

Two simple statements joined by a connective to form a compound
statement

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

whats a conjunct and give an example

A

Each of the component statements in a conjunction
Ex: Example: Julio is here (p), and Juan is here (q):
p & q

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What are terms/symbol that can express grammatical conjunction

A

“and”( &) an an ampersand is the main term but other examples are also: But, yet, nevertheless, while, also,
and moreover.
– In propositional logic, all these are logically
equivalent—they are therefore properly
symbolized by the ampersand (&).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What does the The truth value of a conjunction depend on

A

The truth value of a conjunction depends on the truth values of its
conjuncts—that is, by the truth value of its conjuncts.
* Example: Last night I had a Coke, and I also had an order of
poutine.
– The conjunction is true if, and only if, it’s true both that you had
a Coke last night and that you had a poutine last night.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

How can we identify and keep track of all the possible truth values
of a conjunction?

A

we can create a truth table, which is a
graphic way of displaying all the possibilities:

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

How does the truth table look for conjunctions

A
  • Row 1: When p is true and q is true, p & q is true.
    – Row 2: When p is true and q is false, p & q is false.
    – Row 3: When p is false and q is true, p & q is false.
    – Row 4: When p is false and q is false, p & q is false.
  • If one statement in the conjunction is false, the whole
    conjunction is false; only if both conjuncts are true is the
    whole conjunction true.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

When is a conjunction false

A

If one statement in the conjunction is false, the whole

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

When is a conjunction true

A

only if both conjuncts are true is the
whole conjunction true.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

See The following example:
If it’s true that I had Coke last night and also true that I had
poutine last night, then the statement “I had Coke and also had
poutine last night”
a) Is it a conjunction?
b) Identify the truth value

A

a) Yes
b) Its True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

See the following example:
But if it’s true that I had Coke last night but false that I had
poutine last night, then “I had Coke and also had poutine last
night”
a) Is it a conjunction?
b) Identify the truth value

A

a) yes
b) as a whole,it is false.( becuase one of the staemnets is false making all false)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Whats a disjunction

A

In a disjunction, we assert that either p or q is true (though both
might be), and that even if one of the statements is false, the whole
disjunction is still true

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Whats a disjunct

A

Each of the component statements in a disjunction is called a disjunct.
Example: Either Joan is angry (p) or Ann is serene (q): p v q

17
Q

The symbol for a disjunction is called a

A

The symbol for disjunction is called a ( v ) wedge; it is roughly
equivalent to the word “or.”
– The word “unless” is also sometimes used in place of “or.”

18
Q

What worlds usually signal the beginning of
a disjunction.

A

The words “either” and “neither” usually signal the beginning of
a disjunction.

19
Q

The truth table for a disjunction looks like this:

A
  • Row 1: When p is true and q is true, p v q is true.
    – Row 2: When p is true and q is false, p v q is true.
    – Row 3: When p is false and q is true, p v q is True.
    – Row 4: When p is false and q is false, p v q is false.
20
Q

In a disjunction, p ∨ q is true in every possible combination of Ts and Fs except one,
where

A

both p and q are false (in the last row).

21
Q

For a disjunction to be true….

A

only one of the disjuncts must be
true.
* In English, the word “or” has two meanings:
– “One or the other, or both”: inclusive sense
– “Either but not both”: exclusive sense

22
Q

Whats a negation and what symbol is used

A

the denial of a statement, which we indicate with the
word “not” (or some equivalent term) and the “tilde” symbol (~p).

Example:
* The price of eggs in China is very high (p).
* Negation: The price of eggs in China is not very high: ~p

23
Q

A double negation is the same thing as ….

A

No negation

24
Q

The truth table for a negation looks like ..

A
  • Row 1: When p is true, ~ p is false
    – Row 2: When p is false, ~p is true.
25
Q

The basic form of a conditional

A

“if . . . then . . .”
– Example: If the cat is on the mat (p: antecedent), then
the rat will stay home (q: consequent): p → q

26
Q

The truth table for conditionals looks like

A
  • Row 1: When p is true and q is true, p → q is true.
    – Row 2: When p is true and q is false, p → q is false.
    – Row 3: When p is false and q is true, p → q is true.
    – Row 4: When p is false and q is false, p → q is true.
27
Q

A conditional is false if and only if

A

its antecedent is true and its
consequent is false. In all other possible combinations of truth values, a conditional is
true.

28
Q

Conditional statements can be expressed in ways other than the if–
then configuration (the standard form). Provide some examples

A

Examples of conditionals in various patterns:

– Non-Standard: You will fall off that ladder if you’re not careful.
– Standard: If you’re not careful, you will fall off that ladder.

– Non-Standard: I’ll ride the bus only if I’m late.
– Standard: If I ride the bus, then I’m late.

– Non-Standard: Whenever I think, I get a headache.
– Standard: If I think, I get a headache.

  • Because of such variations in conditional statements, it’s
    important to translate conditionals into standard form before you
    try to assess their validity.
29
Q

If Adam is guilty (P), then either Bob is an accomplice (Q) or Carol is an accomplice (R).
Symbolization : P →(Q v R)

A

This is a conditional, whose consequent is a disjunction.
( refer to lecture 8 slide 9 )

30
Q

The truth table test for validity is based on…

A

an elementary fact
about validity: It’s impossible for a valid argument to have
true premises and a false conclusion.

31
Q

Devising truth tables for arguments can reveal the

A

underlying structure of the arguments, even those that
are fairly complex.

32
Q

CHECKING FOR VALIDITY IN
SIMPLE ARGUMENTS example

A

If the icebergs melt, the lowlands will flood.
The icebergs will not melt.
Therefore, the lowlands will not flood.
p → q
~p
~q

33
Q

CHECKING FOR VALIDITY IN
SIMPLE ARGUMENTS step by step
( lecture 8 slides 21 - 27)

A

1)
For a two-variable argument, we need four rows to account for the
four possible combinations of T and F: T T, T F, F T, and F F. We
place those values in the first two columns immediately, since they
are the same for every two-variable truth table:

2)
To figure out the content for the third column in the table, we need
to use our knowledge of how conditional claims work.
* To fill in the first blank in the third column, we look to the left.
There, we see that p is True and q is also True. When p is True and q
is also True, the conditional p → q is also True. So we know to write
“T” in that first position of the third column.
* We can now reason our way through the rest of the column.

3)
* Now we use the same method to fill in the fourth and fifth columns.
* In the truth table, the truth value of ~p is the contradictory of p,
and the truth value of ~q is the contradictory of q. Therefore,
whatever the truth value of a statement, the tilde (~) reverses it,
from true to false or false to true.

34
Q

You can begin checking the argument’s validity in two
different ways:

A
  1. Inspect all rows that have a false conclusion and then see if the
    premises in that row are true, indicating an invalid argument.
  2. Zero in on rows showing all true premises and then check to
    see if any of them have false conclusions.
    * In this case, the third row is the key: in that row, both
    premises are true, and the conclusion is false. So the
    argument is invalid.
35
Q

example of simple argument
( see slide 28 lecture 8 )

A
  1. If you pass PHL214, I’ll buy you a donut. P → D
  2. You don’t pass PHL214. ~ P
    .:3. I won’t buy you a donut. (from 1,2) .: ~D

Again, our question is this:
can we find a row where all
the premises are true, and
the conclusion is false? If
so, then we know it is an
invalid argument.

  1. Either you will get an A or a B in SSH105. A v B
  2. You don’t get an B in SSH105. ~B .
    .:3. You will get an A in SSH105. (from 1,2) .: A