Test 4 Study Flashcards

(32 cards)

1
Q

what is QE?

A

rule to swap quantifiers.
(∀x)¬(Px ∧ ¬Mx)
———————————-
¬(∃x)(Px ∧ ¬Mx) QE

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

what is UI?

A

rule to remove universal quantifier
(∀x)(Rx –> Bx) can be replaced with (Rm –> Bm)

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

what is EI?

A

rule to remove existential quantifier
(∃x)(Rx –> Bx) can be replaced with (Rm –> Bm)
has to be a new constant

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

what is UG?

A

rule to introduce universal quantifier
(Wm –> Bm) to (x)(Wx –> Bx)

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

what is EG?

A

rule to introduce existential quantifier
(∃x)

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

fill in blank
¬(P ∧ Q)
_______________________
DeM

A

¬P ∨ ¬Q

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

fill in blank
P –> Q
P
___________________________
MP

A

Q

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

fill in blank
P –> Q
¬Q
____________________________
MT

A

¬P

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

fill in blank
P –> Q
Q –> R
———————————
CA

A

P –> R

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

fill in blank
P ∨ Q
¬P
——————————–
DA

A

Q

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

fill in blank
P ∧ Q
———————————–
Simp

A

P

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

fill in blank
P
Q
———————————
Conj

A

P ∧ Q

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

fill in blank
P
———————————-
Add

A

P ∨ Q

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

fill in blank
P –> Q
——————————
Imp

A

¬P ∨ Q

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

fill in blank
P –> Q
——————————-
Contra

A

¬Q –> ¬P

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

T / F : There are unbound variables in this expression: (Ab ∨ (Ba ∧ (∃x)Cx)

17
Q

T / F : This is a formula but not a WFF of PL: (∀x)(Rx → (∃x)Mx).

A

False. It’s not a formula.

18
Q

T / F : This is a correct application of the rule Conj: 7. (∀x)Rx ∧ (∃x)Mx Conj 5,6.

19
Q

T / F : This is a tautology: (∀x)(Bx → (Ax ∨ ¬Ax)).

20
Q

T / F : Any argument with contrary premises is valid.

21
Q

Which rule of PD adds an existential quantifier?

22
Q

Apply QE to the following sentence. (∃x)¬(Px ∨ ¬Mx)

A

¬(∀x)(Px ∨ ¬Mx)

23
Q

Apply DeM to the following sentence. ¬(∀x)¬(Px ∨ ¬Mx)

A

¬(∀x)(¬Px ∧ Mx)

24
Q

Give proper rule abbreviations for 3 of the 5 new rules of PD.

A

QE, UI, UG, EI, EG

25
What two sentences can you get from the following sentence using the rule Imp? (x)(Mx → Wx) ∨ (∃x)¬Mx
¬(x)(Mx → Wx) → (∃x)¬Mx (x)(¬Mx ∨ Wx) ∨ (∃x)¬Mx
26
what's A/IP?
assumption for indirect proof, assumes the negation of the statement we want to prove
27
what's A/CP?
assumption for conditional proof
28
The universal quantifier represents a conjunction. The existential quantifier represents a what?
disjunction
29
Which rule of PD removes a universal quantifier?
UI
30
How many bound variables are there in the following WFF? (∀x)((Ax ∧ Bx) ∨ Ba)
1
31
Give a sentence which is equivalent to the following and name the rule you used which connects them. ¬(∀x)(Rx → Bx)
(∃x)¬(Rx --> Bx), QE
32
The disjunction of an I sentence and an O sentence is obviously a disjunction. But it is also a what (i.e. tautology, contradiction, contingent, large order of fries)?
contingent