exam-example
exam-example
(1) Test.
3) Holmes is right or Moriarty and Crumm are both guilty or both innocent; and
Crumm is guilty.
4) If wise people do not look for wisdom and ignorant people do not look for it too,
then other people are looking for wisdom.
(3) Write the truth table of these formulas and determine if each formula is a
tautology, a contingency or a contradiction and justify ou answer: [1,5 pto]
1) (p¬p)p
2) (pq)(pr)
(4) Determine if {1, ..., n} is a set of formulas which is satisfiable, and justify your
answer: [1,5 pto]
1 p q 2 ¬(r ¬q) 3 ¬p r
b. Determine if is a logical consequence of {1, ..., n}, and justify your answer
[1,5 ptos].
1 (p q) 2 (r ¬p) ßrq
EJERCICIO 1:
EJERCICIO 2: Formalization
1) p= Crumm is innocent
¬p ∨ (p ∧ q)
q= Moriarty is innocent
¬p ∨ q ∨ (¬p ∧ ¬q)
q= Crumm is innocent
3) p= Holmes is right
q= Moriarty is innocent
(¬p ∧ ¬q) → r
r=people who are not wise or ignorant look for wisdom
5) p= Frankestein is outside
q= Frankestein must be careful
r= Frankestein must be kind
s= Frankestein says the truth
t= We will listen to Frankenstein
EJERCICIO 3:
1) (p¬p)p
2) (pq)(pr)
1) Contingente
2) Tautológica
EJERCICIO 4:
1 p q 2 ¬(r ¬q) 3 ¬p r
Para saberlo, podemos unirlas en una única fórmula:
(p q) ¬(r ¬q) (¬p r)
1 (p q) 2 (r ¬p) ßrq
[(p q) (r ¬ p)] (r q)
1 1 1 0 1 0 0 1 1 1 1 1
0 1 1 1 1 1 1 0 1 1 1 1
1 1 0 0 1 0 0 1 1 1 0 0
0 0 0 0 1 1 1 0 1 1 0 0
1 1 1 1 0 1 0 1 1 0 1 1
0 1 1 0 0 0 1 0 1 0 1 1
1 1 0 1 0 1 0 1 1 0 1 0
0 0 0 0 0 0 1 0 1 0 1 0