ISIS-1104 Matemática Estructural y Lógica

Tarea 1
Date: September 3, 2022 Due Date: September 8, 2022 11:59 P.M.

Exercise 1. Let P be a proposition. If you assume P is false, and you prove P , this proves P is true. This
technique is called: Consequentia mirabilis
This is the corresponding inference rule:
¬p ⇒ p
p
1. What is the corresponding propositional formula?
2. Using truth tables, prove that this formula is, in fact, a tautology.
3. Formally prove that the inference rule is valid.
Exercise 2. Consider the following proofs for P a proposition:
1. You assume P and prove P .
2. You assume P and prove f alse
3. You assume P and prove true
For each proof answer the following questions
Does it prove anything? If so, what does it prove. If not, why not?
If it does prove something, indicate the corresponding inference rule and formally prove it is valid.
Exercise 3. We define the following formula:

f oo(x, y, z) = x ↔ y ↔ z (1)
1. Prove or refute: f oo(true, x, y) ≡ (x ≡ y)
2. Prove or refute: f oo(true, f alse, y) ≡ ¬y
3. Prove or refute: ¬f oo(x, y, z) ⇒ ¬x ∨ ¬y ∨ ¬z
4. Prove or refute the validity of the following inference rule:
f oo(x, y, z)
¬x
y∨z
Exercise 4. There was a robbery in Cinderella’s Castle. We have the following suspects:
Peter Pan
Cuasimodo
Robin Hood
Shrek
We know the following:
1. Exactly two of the suspects are guilty.
2. If Robin Hood is innocent, so is Quasimodo
3. If Quasimodo is innocent, Shrek is guilty

1
 4. Shrek was ill and bedridden the day of the crime.
Is it possible to determine who is guilty? If so, who is guilty? If not, why not? If it is, model the problem
and formally prove your conclusion.
Exercise 5. In the land of the fairies:
We know the following facts
• Fairies are either good or evil.
• Fairies are either green or red.
• Evil green fairies can fly.
• Evil red fairies have capes.
• Good fairies can fly?
Gwilinda and Morgana are fairies. We know that:
• Gwylinda is a red fairy
• Morgana is evil
• Neither Morgana nor Gwylinda have capes.
You conclude that both Morgana and Gwylinda can fly.
1. Model the hypothesis, the premises and conclusions using the following predicates:
E(x) x is evil
Go(x) x is good
R(x) x is red
Gr(x) x is green
C(x) x has a cape
F(x) x can fly
Use constants M and G for Morgana and Gwylinda, respectively.
2. Prove the conclusions. You may prove each conclusion separately.