Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

MAT 111 > Chapter 3 > Flashcards

Chapter 3 Flashcards

1
Q

statement

A

a statement is a declarative sentence that is either true or false but not both at the same time

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

simple statement

A

a statement that conveys a single idea

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

compound statement

A

a statement that conveys more than one idea (2+)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q 
Logical connectives meaning
~
Λ
V 
-->
↔
A 
~ = not
Λ = and
V = or
--> = if, then
↔ = if and only if
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q 
symbolic forms
not p
p and q
p or q
if p, then q
p iff q
A 
~p
p Λ q
p V q
p --> q
p ↔ q
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q 
Type of logical connective
~
Λ
V 
-->
↔
A 
~ = negation
Λ = conjunction
V = disjunction
--> = conditional
↔ = biconditional
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Truth value of a simple statement

A

the truth value of a simple statement is either true or false

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

truth value of a compound statement

A

the truth value of a compound statement depends on the truth values of the simple statements and logical connectives used to form the compound statement

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

Truth table

A

a table used to show the truth value of a compound statement for all possible truth values (and combination of truth values) for its simple statements

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

Truth Table for Negations

A

p ~p
T F
F T

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

Negate the following:

My house is blue

A

My house is not blue

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

Negate the following:

Canada is not a country

A

Canada is a country

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

Write the following in symbolic form:

Today is not Friday and it is not raining

A

~ F Λ ~ R

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

Write the following in symbolic form:

If it is not raining, then today is not Friday and I am not going to a movie

A

~ R –> (~F Λ ~ M)

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

Write the following in words:

R Λ F

A

It is raining and today is Friday.

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

~ M V B

A

I am not going to a movie or i am going to a baseball game

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

B ↔ ~F

A

I am not going to a baseball game if and only if today is not Friday.

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

(F Λ ~R) –> (M V B)

A

If today is Friday and it is not raining, then I am going to the movies or I am going to the baseball game.

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

~ (M V R)

A

It is not the case that I am going to a movie or it is raining.

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

Truth table for conjunctions

A 
p   q   p Λ q
T    T      T
T    F      F
F    T      F
F    F      F
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

Truth table for conjunctions

A 
p   q   p Λ q
T    T      T
T    F      F
F    T      F
F    F      F

Both simple statements must be true in order to get a true conjuction

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

Truth table for disjunctions

A 
p   q    p V q
T    T       T
T    F       T
F    T       T
F    F       F

One or the other (or both) must be true in order to get a true disjunction

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q 
Quantifiers (Negate them)
All X are Y
No X are Y
Some X are not Y
Some X are Y
A

Some X are not Y
Some X are Y
All X are Y
All X are not Y or No X are Y

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

Negate the following:

All bears are brown

A

Some bears are not brown

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

Negate the following:

No man is an island

A

Some man is an island

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

Negate the following:

Some vegetables are not green

A

All vegetables are green

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

Negate the following:

Some dogs are yellow

A

No dogs are yellow

28
Q

1 simple statement = 2 rows (2^1)
2 simple statements = 4 rows (2^2)
3 simple statements = 8 rows (2^3)

A

of rows = 2^K where K is the number of simple statements

29
Q

Order of operations for truth tables

A 
Negations of simple statements
() inside out
negations L to R
conjunctions L to R
disjunctions L to R
conditionals L to R
biconditionals L to R
30
Q

Truth table for 3 variables (p, q, r)

A 
p   q   r
T   T  T
T   T  F
T   F  T
T   F  F
F   T  T
F   T  F
F   F  T
F   F  F
31
Q

Equivalent statements

A

Two statements are equivalent if they both have the same truth value for all possible true values of their simple statements (truth tables are the same in the last column)

32
Q

DeMorgan’s Laws

A

~(pΛq) is equivalent to ~ p V ~q

~(pVq) is equivalent to ~ p Λ ~ q

33
Q

Negate:

It is not Monday and it is raining

A

it is Monday or it is not raining

34
Q

Tautology

A

a tautology is a statement that is always true

35
Q

Self-contradiction

A

a self-contradiction is a statement that is always false

36
Q

What is the antecedent in

p –> q

A

p

37
Q

What is the consequent in

p –> q

A

q

38
Q

Conditional

A

p implies q

39
Q

Truth table for conditional

A 
p  q   p --> q
T  T      T
T  F      F
F  T      T
F  F      T

The conditional is only false if the antecedent is true AND the consequent is false

40
Q

Equivalent form of:

p –> q

A

~ p V q

41
Q

Negation of Conditional

A

p Λ ~q

42
Q

Equivalent form of:

p ↔ q

A

(p —> q) Λ (q —> p)

43
Q

Truth table for biconditional

A 
p  q  p ↔ q
T  T       T
T  F       F
F  T       F
F  F       T

The biconditional is only true when both p and q are true or both p and q are false

44
Q

Equivalent statements

A 
q, if p
if p, q
p only if q
p implies q
not p or q
every p is a q
q, if p
q provided that p
q is a necessary condition for p
p is a sufficient condition for q
45
Q

Write in “if p, then q” form:

Every square is a rectangle

A

If it is square, then it is a rectangle

46
Q

Write in “if p, then q” form:

Being older than 30 is sufficient to show that I am at least 21

A

If you are older than 30, then you are at least 21

47
Q

Converse of p —> q

A

q —> p

48
Q

Inverse of p —> q

A

~p —> ~q

49
Q

Contrapositive of p —> q

A

~q —> ~p

50
Q

converse and inverse are equivalent

A

direct conditional and contrapositive are equivalent

51
Q

Modus ponens

A

p —> q
p
∴ q

52
Q

modus tollens

A

p —> q
~ q
∴ ~ p

53
Q

Law of syllogism

A

p —> q
q —> r
∴ p —> r

54
Q

disjunctive syllogism

A

p V q
~ p
∴ q

55
Q

fallacy of the converse

A

p —> q
q
∴ p

56
Q

fallacy of the inverse

A

p —> q
~p
∴ ~q

57
Q

Valid or invalid?

p —> q
~p
∴ ~q

A

invalid, fallacy of the inverse

58
Q

Valid or invalid?

p —> q
q
∴ p

A

invalid, fallacy of the converse

59
Q

Valid or invalid?

p V q
~ p
∴ q

A

valid, disjunctive syllogism

60
Q

Valid or invalid?

p —> q
q —> r
∴ p —> r

A

valid, Law of syllogism

61
Q

Valid or invalid?

p —> q
~ q
∴ ~ p

A

valid, modus tollens

62
Q

Valid or invalid?

p —> q
p
∴ q

A

valid, modus ponens

63
Q

How do you know if an argument is valid?

A

if the conclusion in every row of the truth table in which all the premises are true, the argument is valid. If the conclusion is false in any row in which all of the premises are true, the argument is invalid

64
Q

Write in if then format:

You need a four-wheel drive to make the trip through Death Valley.

A

If you are making the trip through Death Valley, then you need a four-wheel drive.

65
Q

Write the converse:

You need a four-wheel drive to make the trip through Death Valley.

A

If you need a four-wheel drive, then you are making the trip through Death Valley.

66
Q

Write the inverse:

You need a four-wheel drive to make the trip through Death Valley.

A

If you are not making the trip through Death Valley, then you do not need four-wheel drive.

67
Q

Write the contrapositive:

You need a four-wheel drive to make the trip through Death Valley.

A

If you do not need four-wheel drive, then you are not making the trip through Death Valley.

MAT 111 (5 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions