The following is a true statement in logic:
If I am a cat, I love eating dark matter.
If you donât know why this is true, logic is not what you think it is. In this post, I explain why many such absurd statements are true, and what this has to do with the foundations of logic.
This is the truth table for the conditional operator â->â (where âA -> Bâ = âif A then Bâ):
A | B | A -> B |
---|---|---|
T | T | T |
T | F | F |
F | T | T |
F | F | T |
Read this row-by-row. The first row tells us that âA is True, B is True, A -> B is True.â The galaxy-eating-cat-Kerem statement corresponds to the last row: A = Kerem is a cat (I am not, so this is false); B = I love eating dark matter (âŚalso false, as far as I know); but somehow A -> B is true.
Now we can phrase our key question more precisely: Why on earth is A -> B only false in the second row?
Logic intuitively sound like a machine that arbitrates objective truths about the world (i.e., a causal truth detector). It isnât. Here is another example:
If I am the pope, I can fly.
If we were building a truth detector, we could just stop at the premiseâI am not the pope, this is false. Maybe we are building a counterfactual truth detectorâin that case, we need to read the implication, and compare it to our simulated worldâif I were abducted and baptized and pope-ified, would I be able to fly?^{1} No. No matter how we spin it, the proposition being true seems bizarre. But we are not building a truth detector.
To scaffold our understanding, it is useful to first think of logic as a lie detector. Consider the following:
Your honor, if am the pope, I can fly.
This is a weird statement, but itâs not like Iâm lying. Iâm just not the pope. Similarly, the statement:
Your honor, if am the pope, I am Christian.
Is not a lie. It is only a lie if the premise is true and what follows is false:
Your honor, if my name is Kerem, I am the pope.
This is a lie, and it is coincidentally the only way we get falsehood from the truth table. So lie detection gives us the right intuitions in this case.
Why does lie detection work as a framing? And why is it the âright wayâ to define the conditional operator â->â?
This framing works because lies are about contradictions, rather than falsehoods, and logic is a machine for detecting consistent and âgoodâ inferences, rather than truth. The â->â operator is a primitive component of this machine.
There is nothing essentially correct about defining â->â this way, much like there is nothing essentially correct about the definition of any primitive component of a formal system. For example, pawns move forward in chess, but not because it is the right way for them to move. It is because chess is more fun when their movement is restricted in this way, and the goal of chess is to produce fun. Similarly, the goal of logic is to detect good inferences, and a primitive with properties similar to a lie detector turns out to be useful for that aim. The definitions of primitives follow from what you want the system to be able to do.
But it isnât a priori obvious which primitives will achieve your goals; and typically, systems evolve primitives over time. For example, chess evolved as a system from its ancestors (e.g., the Egyptian senet):^{2}
Itâs not like board game designers knew what would be more funâthey just knew fun when they had it. Similarly, people were arguing and figuring out what is a good inference before they had formal logic.^{3} Formal logic was built to satisfy these âgood inferenceâ criteria.
For instance, the following inference, called modus ponens, seems solid:
A -> B [If there are bees, then I scream]
A [There are bees]
â´ B [I scream]
Where ââ´â means âtherefore.â We want logic to identify this as a good inference. How do we do this?
First, we can rewrite it as a single statement. The first two bits, when combined, should lead to the third. We can write the combination through ^ (the conjunction):
A ^ (A -> B) -> B.
We need to define â->â in such a way that this sentence as a whole is evaluated as good, regardless of what the inputs (A, B) are, because we deemed this inference to be valid a priori. We will call a valid/good inference true, and an invalid inference false.
We can show that the âlying framingâ works [i.e., the third column is only false when A = T & B = F; and the final column is all true, indicating that the full inference is always valid]:
A | B | A -> B | A ^ (A -> B) | A ^ (A -> B) -> B |
---|---|---|---|---|
T | T | T | T | T |
T | F | F | F | T |
F | T | T | F | T |
F | F | T | F | T |
We can try an alternative definition and see that it fails. Imagine that we go by the âtruth detectorâ setup for the â->â operator. So the only time A -> B is true is if both A = T & B = T:
A | B | A -> B | A ^ (A -> B) | A ^ (A -> B) -> B |
---|---|---|---|---|
T | T | T | T | T |
T | F | F | F | F |
F | T | F | F | F |
F | F | F | F | F |
This way of defining â->â does not end up telling us that the inference as a whole is valid. The lie detector framing does, hence we use it as a primitive. And it works.
This is a nice puzzle for psychology. Probably because a human that drew useless inferences in simple cases would not survive. These kinds of arguments are called âdutch-bookâ arguments.^{4} There is also something deeply unsatisfying about those, but that is a story for another timeâŚ
See modal logic.Â ↩
Some even think that the origins of reasoning itself emerge from argumentation (Mercier & Sperber, 2011). Seems unlikely, but interesting.Â ↩
Queen Nefertari Playing Senet, ca. 1279-1213 B.C; from Nefertariâs tomb. It turns out that Chess is more easily traced back to an Indian game called Chaturanga, but I like this picture.Â ↩
These arguments are also used as evolutionary arguments for Bayesian approaches to cognition.Â ↩