Chapter 0.2: Mathematical Statements Flashcards

1
Q

What is a statement?

A

Any declarative sentence which is either true or false

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

What are the two types of statements?

A

Atomic; cannot be divided not smaller statements. Molecular.

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

Molecular statements can be built by combining atomic statements using ____.

A

Logical connectives

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

What are binary connectives? List them?

A

Connectives that connect two statements: conjunction, disjunction, implication, biconditional

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

What are unary connectives? List them?

A

Applies to a single statement only: negation.

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

When trying to figure out the ____ of a molecular statement we only need to know the truth values of its atomic components combined with the logical connective

A

Truth value

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

List the 4 propositional variables

A

P Q R S

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

List the 5 logical connectives and their plain English counterparts and their Symbol

A

Conjunction; “And”; ∧

Disjunction; “Or”; ∨

Implication; “if…, then…; –>

Biconditional; “if and only if”;

Negation; “Not”; ¬

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

What does it mean that the disjunction “or” is inclusive?

A

Both statements can be true as well

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

When is a conjunction true?

A

When both statements are true.

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

When is a disjunction true?

A

When either, or both statements are true

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

When is an implication true?

A

When the P is false, or if Q is true or both.

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

When is a biconditional true?

A

When both statements have the same truth value

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

When is a negation true?

A

When the statement is false.

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

In an implication, what are P and Q called? Include alternatives.

A

P: hypothesis or antecedent

Q: conclusion or consequent

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

What is the converse of the implication P –> Q?

A

Q –> P

17
Q

T/F: The truth value of the converse is dependent on the truth value of the original implication.

A

F

18
Q

What is the contrapositive of P –> Q?

A

¬Q –> ¬P

19
Q

When P –> Q and Q –> P are both true, we can say that Q and P are ____.

A

Biconditionals

20
Q

“If and only if” statements must have a forward direction and a backwards direction that are both ___.

A

True

21
Q

What does “P is necessary for Q” translate into symbolically?

A

Q –> P

22
Q

What does “P is sufficient for Q” translate into symbolically?

A

P –> Q

23
Q

What does P is sufficient and necessary for Q” translate into symbolically?

A

P Q

24
Q

If you have an assumption, you must think about …

A

What is necessary to make that hypothesis true

25
Q

What is this P(n) –> ¬P(n + 7)? What makes it so?

A

A predicate, it has free variables.

26
Q

What are free variables?

A

Variables that have yet to be specified

27
Q

What is the symbol and plain English translation for an existential quantifier?

A

∃, reads “there exists” or “there is.”

28
Q

What is the symbol and plain English translation for a universal quantifier?

A

∀, reads “for all” or “every”

29
Q

Convert this into plain English: ∀x∃y(y < x). what is this an example of?

A

“For all x there exists y in which y is less than x.” This is a quantified statement

30
Q

What is the Domain of discourse for a quantified statement?

A

The values being considered when we say “all”

31
Q

What is the default Domain of discourse in discrete math?

A

All-natural numbers {0, 1, 2, …}

32
Q

¬∀xP(x) is equivalent to _____. Say both quantified statements in plain English.

A

¬∀xP(x) is equivalent to ∃x¬P(x)

“If not everything has a property, then something doesn’t have a property.”

33
Q

¬∃xP(x) is equivalent to _____. Say both quantified statements in plain English.

A

¬∃xP(x) is equivalent to ∀x¬P(x)

“If there is not something with a property, then everything doesn’t have that property”

34
Q

Assume that sentences containing predicates with free variables are intended as statements, where…

A

the variables are universally quantified.

35
Q

____ is a statement that cannot be true or false?

A

Imperative statement