2.1:
(8):
a: h∧ w ∧~s
b: ~w ∧ h ∧ s
c: ~h ∧ ~w ∧ ~s
d: ~w ∧ ~s ∧ h
e: w ∧ ~h ∧~s
(46):
a:
Truth Table:
p | p ⊕ p | (p ⊕ p) ⊕p |
T | F | T |
F | F | F |
We note that p ⊕ p is always false, thisthen implies that p ⊕ p is a contradiction and a contradiction is denoted by c.So p ⊕ p ≡ c.
We note that (p ⊕ p) ⊕p always has the sametruth value as p. So (p ⊕ p) ⊕p ≡ p.
In a word , p ⊕ p ≡ c , (p ⊕ p) ⊕p ≡ p.
b:
I think (p ⊕ q) ⊕ r ≡ p ⊕ (q ⊕ r) is true.
Truth Table:
p | q | r | p ⊕ q | q⊕ r | ( p ⊕ q ) ⊕ r | P ⊕ (q ⊕ r) |
T | T | T | F | F | T | T |
T | T | F | F | T | F | F |
T | F | T | T | T | F | F |
T | F | F | T | F | T | T |
F | T | T | T | F | F | F |
F | T | F | T | T | T | T |
F | F | T | F | T | T | T |
F | F | F | F | F | F | F |
The last two columns of the truth tablehave the same truth values int each row , so the two expressions are logicallyequivalent.
(p ⊕ q) ⊕ r ≡ p ⊕ (q ⊕ r)
c:
I think (p ⊕ q) ∧ r ≡ (p ∧ r) ⊕ (q ∧ r) is true.
Truth Table:
p | q | r | p ⊕ q | p ∧ r | q ∧ r | (p ⊕ q)∧r | (p ∧ r) ⊕(q ∧ r) |
T | T | T | F | T | T | F | F |
T | T | F | F | F | F | F | F |
T | F | T | T | T | F | T | T |
T | F | F | T | F | F | F | F |
F | T | T | T | F | T | T | T |
F | T | F | T | F | F | F | F |
F | F | T | F | F | F | F | F |
F | F | F | F | F | F | F | F |
We note that the lasttwo columns of the truth table have the same truth values in each row , the twoexpressions are logically equivalent.
So (p ⊕ q) ∧ r ≡ (p ∧ r) ⊕ (q ∧ r).
(53):
Answer:
∼((∼p ∧ q) ∨ (∼p ∧ ∼q)) ∨ (p ∧ q) ≡(~(~p ∧ q) ∧ ~(~ p ∧ ~ q)) ∨ (p ∧ q) De Morgan’s law
≡((~(~p)∨~q) ∧(~(~p) ∨~(~q)) ∨(p ∧q) De Morgan’s law
≡((p∨~q) ∧(p ∨q) ∨( p ∧q) Double negation law
≡(p ∨(~q ∧q) ∨(p ∧q) Distributive law
≡(p ∨ c) ∨ (p ∧ q) Negation law ≡p ∨ (p ∧q) Identity law
≡p Absorption law
So ∼((∼p∧ q) ∨ (∼p∧ ∼q)) ∨ (p∧ q) ≡ p
(54):
Answer:
(p ∧ (∼(∼p ∨ q))) ∨ (p ∧ q) ≡ (p ∧ (~(~p) ∧~q)∨ (p ∧ q) De Morgan’s law
≡ (p ∧ ( p ∧ ~q) )∨ (p ∧ q) Doublenegation law
≡ ((p ∧p) ∧~q) ∨ (p ∧ q) Associativelaw
≡(p ∧ ~q) ∨ (p ∧ q) Idempotent law
≡p ∧ (~q ∨ q) Distributive law
≡p ∧ t Negationlaw
≡p Identity law
So (p ∧ (∼(∼p ∨ q))) ∨ (p ∧ q) ≡ p
2.2:
(18):
Answer:
Let a be ‘It walks like a duck’ , b be ‘it talks like a duck’, c be ‘it is a duck’
Statements 1 : a ∧ b → c
Statements 2:(~a∨~b) ∨ c
Statements 3:(~a ∧ ~b) →~c
Truth Table:
a | b | c | a ∧b | a ∧ b → c | ~a | ~b | ~a∨~b | (~a∨~b) ∨ c | ~c | ~a ∧ ~b | (~a ∧ ~b) →~c |
T | T | T | T | T | F | F | F | T | F | F | T |
T | T | F | T | F | F | F | F | F | T | F | T |
T | F | T | F | T | F | T | T | T | F | F | T |
T | F | F | F | T | F | T | T | T | T | F | T |
F | T | T | F | T | T | F | T | T | F | F | T |
F | T | F | F | T | T | F | T | T | T | F | T |
F | F | T | F | T | T | T | T | T | F | T | F |
F | F | F | F | T | T | T | T | T | T | T | T |
We note that Statement1 and 2 are logically equivalent , but neither are equivalent to statement 3 .
(20.e):
Answer:
p = x isnonnegative
q= x is positive
r = x is 0
We can rewrite the given statement as:
P →(q ∨ r)
Then the negation of the statement is :
~( P →(q ∨ r)) ≡~(~p V( q V r))
≡p ∧ ~(q V r )
≡p ∧ (~q ∧ ~r)
SO the negation is x isnonnegative, x is not positive and not 0
(21):
Answer:
a：∼p → q
Truth Table:
p | q | ~p | p → q | ~p → q |
T | T | F | T | T |
T | F | F | F | T |
F | T | T | T | T |
F | F | T | T | F |
We note that p → q isfalse in the second row of the table, whilewe note that the truth value of ~p → q is true in the second row.
b: p ∨ q
Truth Table:
p | q | p → q | p V q |
T | T | T | T |
T | F | F | T |
F | T | T | T |
F | F | T | F |
We note that p → q isfalse in the second row of truth table , while we note that the truth table of pV q is true in the second row.
C: q → p
Truth Table:
p | q | p → q | q → p |
T | T | T | T |
T | F | F | T |
F | T | T | F |
F | F | T | T |
We note that p → q is false In the second row of truth table , whilewe note that the truth value of q → p is true in the second row.
(47):
p∧ ∼q → r
a: Using the logical equivalence p→ q ≡∼p ∨ q:
p∧ ∼q → r≡~(p∧~q) V r
b: p ∧ ∼q → r≡~(p∧~q) V r
Using the logicalequivalence p ∨ q ≡∼(∼p∧ ∼q)
p∧ ∼q → r≡~(p∧~q) V r
≡~(~(~(p∧~q) )∧~r)
≡~( (p∧~q) ∧~r)
(48):
p∨ ∼q → r∨ q
a: Using the logical equivalence p → q ≡∼p ∨ q:
p ∨ ∼q→ r ∨ q≡~(p ∨ ∼q) ∨ (r∨ q)
b: Using the logical equivalence p ∨ q ≡∼(∼p∧ ∼q)
p ∨ ∼q→ r ∨ q≡~(p ∨ ∼q) ∨ (r∨ q)
≡~(~(~p∧~(~q))) ∨ (r ∨ q)
≡~(~(~p ∧ q)) ∨ (r ∨ q)
≡(~p ∧ q) ∨ (r ∨ q)
≡~(~(~p ∧ q) ∧~(r ∨ q))
≡~(~(~ p ∧ q) ∧ (~r ∧ ~q))
2.3
(7):
Answer:
Truth Table:
p | q | r | ~q | p | p → q | ~q ∨ r | r |
T | T | T | F | T | T | T | T |
T | T | F | F | T | T | F | F |
T | F | T | T | T | F | T | T |
T | F | F | T | T | F | T | F |
F | T | T | F | F | T | T | T |
F | T | F | F | F | T | F | F |
F | F | T | T | F | T | T | T |
F | F | F | T | F | T | T | F |
All statements in anargument except for the final one, are called premises and the final statementis called the conclusion , So columns 5 to 7 are premises and the 8thcolumn is the conclusion.
The only situation thatshows all the premises are true is in the 1st row , Since , theconclusion is also true here , the argument form is valid.
(25):
Answer:
P= This real number isrational or irrational.
q = This real number isirrational.
Then we can rewrite thegiven argument as :
p ∨ q
~p
∴ q
We note that the above logical formcorresponds with the inference rule of elimination. So the given argument isvalid.
(31)：
Answer:
Letp = Sandra knows Java
q = Sandra knowns C++
Thenwe can rewrite the given argument as :
p∧ q
∴ q
We notethat the above logical form corresponds with the specialization . Becausespecialization is an inference rule, the given argument is valid.
(40):
Answer:
We can guess , if Sockolies , then Muscles speaks the truth and if Muscles lies , then Socko speaksthe truth . Thus either Socko or Muscles speaks the truth .
Because only one of thefour people spoke the truth and since either Socko or Muscles speaks the truth, the remaining two people are lying. By specialization , Lefty is then lyingand Fats is then also lying. Because Fats is lying, so Muscles then has to bethe killer.
In a word , Muscleskills Sharky.
注：其余答案可在资源中查看
扫一扫
346
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
