Among a sample of diverse coins from an unfamiliar country, each face of any coin portrays one of four things: a judge’s head, an explorer’s head, a building, or a tree.
Statements
Each side of the coin has one of these four options: 1. judge's head 2. explorer's head 3. building 4. tree
conditionals (none, all)
Head on one side → building or tree (other)
Judge on one side → tree (other)
Evaluate
With this set of facts, we could potentially react to the two conditionals (none, all) and see if we can chain them together, but they don't quite have any obvious overlapping terms.
We could otherwise just think about what possible coin combinations there are, since there aren't that many. Like most currency, you don't have heads on each side (although they didn't rule out the possibility of "Tails" on both sides).
Given these four options: J, E, B, T We know that you can't have JJ, EE, or JE (because that would be two heads on the same coin).
So what can we have? JB, JT EB, ET BT
What about the second conditional? If there's a J on one side, there's a T on the other. So it turns out JB is not possible.
Goal
We know the four possible coins look like this: JT, EB, ET, BT
Let's find something that must be true, given those possibilities.