Logic puzzle question. "After excavating for weeks, you finally arrive at the burial chamber...."

Aion

Junior Member
Joined
May 8, 2018
Messages
211
3. After excavating for weeks, you finally arrive at the burial chamber. The room is empty except for two large quests. On each is carved a message:

If this chest is empty, then the other chest's message is true.

This chest is filled with treasure or the other chest contains deadly scorpions.


You know exactly one of these messages is true. What should you do?


I attempted to formalize the two statements in the following way:

Define the constant individuals as

x1x_1=:Chest 1, x2x_2=: Chest 2, aa=: treasure, bb=: Deadly scorpions

Let R(x,y)R(x,y) denote the binary relation: xx is a chest and yy is the content contained in xx.


Then the first statement could be formalized as

¬y(R(x1,y))R(x2,a)R(x1,b)\neg \exist y(R(x_1,y)) \rightarrow R(x_2,a) \lor R(x_1,b) (1)

And the second statement as:

R(x2,a)R(x1,b)R(x_2,a) \lor R(x_1,b) (2)


We have two cases to consider, either (1) is true and (2) false, or (1) is false and (2) is true.


In the first case

¬y(R(x1,y))R(x2,a)R(x1,b)=T\mid \neg \exist y(R(x_1,y)) \rightarrow R(x_2,a) \lor R(x_1,b) \mid=T
And
R(x2,a)R(x1,b)=F\mid R(x_2,a) \lor R(x_1,b) \mid=F
This implies the truth value of the whole statement can be divided into two possible conditions.

¬yR(x1,y)=For¬yR(x1,y)=T\mid \neg\exist y R(x_1,y)\mid =F\quad \text{or} \quad \mid \neg\exist y R(x_1,y)\mid =T
Case (i)
¬yR(x1,y)=Fiffy((x1,y)R)\mid \neg\exist y R(x_1,y)\mid =F\quad \text{iff} \quad \exist y( (x_1,y)\in R)And
R(x2,a)R(x1,b)=Fiff(x2,a)∉Rand(x1,b)∉R\mid R(x_2,a) \lor R(x_1,b) \mid=F \quad \text{iff} \quad (x_2,a)\not\in R \quad \text{and} \quad (x_1,b)\not\in R

Case (ii)
¬yR(x1,y)=Tiffy((x1,y)∉R)\mid \neg\exist y R(x_1,y)\mid =T \quad \text{iff} \quad \forall y( (x_1,y)\not\in R)And
R(x2,a)R(x1,b)=Fiff(x2,a)∉Rand(x1,b)∉R\mid R(x_2,a) \lor R(x_1,b) \mid=F \quad \text{iff} \quad (x_2,a)\not\in R \quad \text{and} \quad (x_1,b)\not\in R

The second case we have

¬y(R(x1,y))R(x2,a)R(x1,b)=F\mid \neg \exist y(R(x_1,y)) \rightarrow R(x_2,a) \lor R(x_1,b) \mid=F
and R(x2,a)R(x1,b)=T\mid R(x_2,a) \lor R(x_1,b) \mid=T
However this is not possible, since an implication is only false if the antecedent is true the consequent is false. In this case, we would have both

R(x2,a)R(x1,b)=FandR(x2,a)R(x1,b)=T\mid R(x_2,a) \lor R(x_1,b) \mid=F \quad \text{and} \quad \mid R(x_2,a) \lor R(x_1,b) \mid=T
Which is impossible, hence no truth value would satisfy both statements at the same time. Hence we can conclude only cases (i) and (ii) are possible.

y(x1,y)Rand(x2,a)∉Rand(x1,b)∉R \exist y(x_1,y)\in R \quad \text{and} \quad (x_2,a)\not\in R \quad \text{and} \quad (x_1,b)\not\in R or
y(x1,y)∉Rand(x2,a)∉Rand(x1,b)∉R \forall y(x_1,y)\not\in R \quad \text{and} \quad (x_2,a)\not\in R \quad \text{and} \quad (x_1,b)\not\in R
In words, we can translate the conclusion from case (i) as

x1x_1 is nonempty, and x2x_2 does not contain treasure and x1x_1 does not contain scorpions.

And similarly from case (ii)

x1x_1 is empty and x2x_2 does not contain treasure and x1x_1 does not contain scorpions.

From this it is clear that the best choice to pick is x1x_1 since we have shown that x2x_2 does not contain treasure in either case, meanwhile, x1x_1 could be empty, or nonempty but it does not contain any scorpions. This is my reasoning although I am interested if I have made some logical mistake as I haven't studied logic in a long time.
 
3. After excavating for weeks, you finally arrive at the burial chamber. The room is empty except for two large quests. On each is carved a message:

If this chest is empty, then the other chest's message is true.

This chest is filled with treasure or the other chest contains deadly scorpions.


You know exactly one of these messages is true. What should you do?


I attempted to formalize the two statements in the following way:

Define the constant individuals as

x1x_1=:Chest 1, x2x_2=: Chest 2, aa=: treasure, bb=: Deadly scorpions

Let R(x,y)R(x,y) denote the binary relation: xx is a chest and yy is the content contained in xx.


Then the first statement could be formalized as

¬y(R(x1,y))R(x2,a)R(x1,b)\neg \exist y(R(x_1,y)) \rightarrow R(x_2,a) \lor R(x_1,b) (1)

And the second statement as:

R(x2,a)R(x1,b)R(x_2,a) \lor R(x_1,b) (2)


We have two cases to consider, either (1) is true and (2) false, or (1) is false and (2) is true.


In the first case

¬y(R(x1,y))R(x2,a)R(x1,b)=T\mid \neg \exist y(R(x_1,y)) \rightarrow R(x_2,a) \lor R(x_1,b) \mid=T
And
R(x2,a)R(x1,b)=F\mid R(x_2,a) \lor R(x_1,b) \mid=F
This implies the truth value of the whole statement can be divided into two possible conditions.

¬yR(x1,y)=For¬yR(x1,y)=T\mid \neg\exist y R(x_1,y)\mid =F\quad \text{or} \quad \mid \neg\exist y R(x_1,y)\mid =T
Case (i)
¬yR(x1,y)=Fiffy((x1,y)R)\mid \neg\exist y R(x_1,y)\mid =F\quad \text{iff} \quad \exist y( (x_1,y)\in R)And
R(x2,a)R(x1,b)=Fiff(x2,a)∉Rand(x1,b)∉R\mid R(x_2,a) \lor R(x_1,b) \mid=F \quad \text{iff} \quad (x_2,a)\not\in R \quad \text{and} \quad (x_1,b)\not\in R

Case (ii)
¬yR(x1,y)=Tiffy((x1,y)∉R)\mid \neg\exist y R(x_1,y)\mid =T \quad \text{iff} \quad \forall y( (x_1,y)\not\in R)And
R(x2,a)R(x1,b)=Fiff(x2,a)∉Rand(x1,b)∉R\mid R(x_2,a) \lor R(x_1,b) \mid=F \quad \text{iff} \quad (x_2,a)\not\in R \quad \text{and} \quad (x_1,b)\not\in R

The second case we have

¬y(R(x1,y))R(x2,a)R(x1,b)=F\mid \neg \exist y(R(x_1,y)) \rightarrow R(x_2,a) \lor R(x_1,b) \mid=F
and R(x2,a)R(x1,b)=T\mid R(x_2,a) \lor R(x_1,b) \mid=T
However this is not possible, since an implication is only false if the antecedent is true the consequent is false. In this case, we would have both

R(x2,a)R(x1,b)=FandR(x2,a)R(x1,b)=T\mid R(x_2,a) \lor R(x_1,b) \mid=F \quad \text{and} \quad \mid R(x_2,a) \lor R(x_1,b) \mid=T
Which is impossible, hence no truth value would satisfy both statements at the same time. Hence we can conclude only cases (i) and (ii) are possible.

y(x1,y)Rand(x2,a)∉Rand(x1,b)∉R \exist y(x_1,y)\in R \quad \text{and} \quad (x_2,a)\not\in R \quad \text{and} \quad (x_1,b)\not\in R or
y(x1,y)∉Rand(x2,a)∉Rand(x1,b)∉R \forall y(x_1,y)\not\in R \quad \text{and} \quad (x_2,a)\not\in R \quad \text{and} \quad (x_1,b)\not\in R
In words, we can translate the conclusion from case (i) as

x1x_1 is nonempty, and x2x_2 does not contain treasure and x1x_1 does not contain scorpions.

And similarly from case (ii)

x1x_1 is empty and x2x_2 does not contain treasure and x1x_1 does not contain scorpions.

From this it is clear that the best choice to pick is x1x_1 since we have shown that x2x_2 does not contain treasure in either case, meanwhile, x1x_1 could be empty, or nonempty but it does not contain any scorpions. This is my reasoning although I am interested if I have made some logical mistake as I haven't studied logic in a long time.
In retrospect, there might be other formalizations that would yield different conclusions on this problem. Although I thought mine was pretty straightforward.
 
Top