| Introductory Logic |
Quiz #2
|
March 10, 2006
|
| Name: ________________________ |
R. Hammack
|
Score: _________
|
|
1.
|
Translate the following sentences into symbolic form, with letters representing simple statements. |
|
(a)
|
If today is Friday, then we have a quiz and it's not difficult. |
F = "Today is Friday"
Q = "We have a quiz"
D = "It is difficult"
F ⊃ (Q • ~D)
|
(b)
|
Microsoft does not acknowledge a monopoly, and if Intel lays off workers, then Dell or Apple will have job applicants. |
M = "Microsoft does acknnowledge a monopoly"
I = "Intel lays off workers"
D = "Dell will have job applicants"
A = "Apple will have job applicants"
~M • (I ⊃ (D ∨ A))
2. Write the truth tables for each of the five logical
operators.
|
|
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||
3. Suppose statements A and B are true,
and X and Y are false. Decide if the following statement is true
or false.
|
[
|
X
|
≡
|
(
|
A
|
⊃
|
~
|
B
|
)
|
]
|
•
|
(
|
X
|
∨
|
A
|
)
|
|
[
|
F
|
≡
|
T
|
⊃
|
T
|
)
|
]
|
•
|
(
|
F
|
∨
|
T
|
)
|
||
|
(
|
F
|
≡
|
(
|
T
|
⊃
|
F
|
)
|
]
|
•
|
T
|
|||||
|
[
|
F
|
≡
|
F
|
]
|
•
|
T
|
|||||||||
|
T
|
•
|
T
|
|||||||||||||
|
T
|