Quiz 21 Flashcards

1
Q

How do you use (∃x∈A) P(x) in a proof?

A

Use x∈A where x is generic. Use P(x).

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

What is the following inference rule called?

P(x) where x can be anything you choose

∴ ∃x P(x)

A

Existential Generalization

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

Select a reasonable strategy for proving ∀x P(x)

A

Prove P(x) where x is generic.

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

Which of the following is called Universal Instantiation?

A

∀x P(x)

∴ P(x) where x can be anything you choose

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

Select all reasonable strategies for proving q → p

A

Assume q. Prove p.
Assume ¬p. Prove ¬q
Assume q. Assume ¬p. Prove 0.

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

What is the following inference rule called?

x∈A → P(x) where x is generic

∴ (∀x∈A) P(x)

A

Universal Generalization

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

How might you use ∃x P(x) in a proof?

A

Existential Instantiation

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

Which rule of inference justifies the final step in a typical proof of (∀x∈A) P(x)?

A

Universal Generalization

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

How might you use p → q in a proof of p?

A

You can’t.

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

Select a reasonable strategy for proving (p → q) → r

A

Assume p → q. Prove r.

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

Select all reasonable strategies for proving p.

A

Use the definition of p.
Assume ¬p. Prove 0.
Assume ¬p. Prove p.

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

How do you use ∀x P(x) in a proof?

A

Use P(x) where x is whatever you want it to be.

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

Select all reasonable strategies for proving (p ∨ q) → r

A
Prove p → r.  Prove q → r.
Part 1: Assume p.  Prove r.
Part 2: Assume q.  Prove r.
Part 1: Assume q.  Prove r.
Part 2: Assume p.  Prove r.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Select a reasonable strategy for proving (∃x∈A) P(x)

A

Prove x∈A where x is anything you want it to be. Prove P(x).

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

Which of the following is called Existential Instantiation?

A

∃x P(x)

∴ P(x) where x is generic

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

Select all reasonable strategies for proving p ↔ q.

A
Prove p → q.  Prove q → p.
Prove p → q.  Prove ¬p → ¬q.
Part 1: Assume p.  Prove q.
Part 2: Assume q.  Prove p.
Part 1: Assume q.  Prove p.
Part 2: Assume p.  Prove q.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

Select all reasonable strategies for proving (∀x∈A) P(x)

A

Prove x∈A → P(x), where x is generic.

Assume x∈A where x is generic. Prove P(x).

18
Q

How might you use p → q in a proof of ¬p?

A

Modus tollens.

19
Q

Which rule of inference justifies the final step in a typical proof of ∃x P(x)?

A

Existential Generalization

20
Q

How might you use (∃x∈A) P(x) in a proof?

A

Existential Instantiation

21
Q

What is the following inference rule called?

(∃x∈A) P(x)

∴ x∈A ∧ P(x) where x is generic

A

Existential Instantiation

22
Q

Select a reasonable strategy for proving ∃x P(x)

A

Prove P(x) where x is whatever you want it to be.

23
Q

What is the following inference rule called?

(∀x∈A) P(x)

x∈A where x can be anything you choose

∴ P(x)

A

Universal Instantiation

Universal Modus Ponens

24
Q

How might you use ∀x P(x) in a proof?

A

Universal Instantiation

25
Q

Select a reasonable strategy for proving (p ∧ q) → r

A

Assume p. Assume q. Prove r.

26
Q

Select a reasonable strategy for proving p ∧ q

A

Prove p. Prove q.

27
Q

How might you use p → q in a proof of q?

A

Modus ponens.

28
Q

What is the following inference rule called?

P(x) where x is generic

∴ ∀x P(x)

A

Universal Generalization

29
Q

Which of the following is called Existential Generalization?

A

P(x) where x can be anything you choose

∴ ∃x P(x)

30
Q

How do you use p ∧ q in a proof?

A

Use p. Use q.

31
Q

What is the following inference rule called?

P(x) where x can be anything you choose

x∈A

∴ (∃x∈A) P(x)

A

Existential Generalization

32
Q

Select all reasonable strategies for proving ¬p.

A

Use the definition of p.
Assume p. Prove 0.
Assume p. Prove ¬p.

33
Q

Which of the following is called Universal Generalization?

A

P(x) where x is generic

∴ ∀x P(x)

34
Q

Which of the following are valid inference rules?

A

First 4
∀x P(x)
∴ P(x) where x can be anything you choose

P(x) where x is generic
∴ ∀x P(x)

∃x P(x)
∴ P(x) where x is generic

P(x) where x can be anything you choose
∴ ∃x P(x)

35
Q

How do you use ∃x P(x) in a proof?

A

Use P(x) where x is generic

36
Q

Which rule of inference justifies the final step in a typical proof of ∀x P(x)?

A

Universal Generalization

37
Q

What is the following inference rule called?

∃x P(x)

∴ P(x) where x is generic

A

Existential Instantiation

38
Q

What is the following inference rule called?

∀x P(x)

∴ P(x) where x can be anything you choose

A

Universal Instantiation

39
Q

Which rule of inference justifies the final step in a typical proof of (∃x∈A) P(x)?

A

Existential Generalization

40
Q

How do you use (∀x∈A) P(x) in a proof?

A

Prove x∈A where x is anything you want it to be. Use P(x).

41
Q

How might you use p → q in a proof of ¬q?

A

You can’t.