Heres a practical exercise for you ILP folk. But feel free to argue or discuss.
The law of non-contradiction is an utterly beautiful concept.
Here’s a little guide on how to appreciate it using Propositional Logic (PL) and Truth Tables.
The law of non-contradiction simply says that a state of affairs cannot be the case and not the case at the same time. This might seem obvious, but unlike alot of other seemingly obvious things (like causality or induction) with PL you can prove it must always hold.
In PL we can write the law as “~(p&~p)”.
For starters a truth value is simply whether the statement is “true” or “false”. Whether it happens to be the case, or not the case.
“~” is negation or “not”. It inverts the truth value of the statement it applies to. Eg. “I am not French” is the opposite truth value of “I am French”
Brackets “()” are used in the same way as brackets in maths; they show what the preceeding operator applies to (in this case, the first “~” applies to the rest of the statement as opposed to just the first “p”, while the second “~” only applies to the second “p”
“&” is conjunction or “and”. It is true only when both the parts on either side of it are true. Eg. the statement “Pierre and Ivan are French” is only true if (and only if) both Pierre and Ivan are French.
“p” is a variable which can be substituted to any statement you like. Non-contradiction happens to apply to EVERY statement as we shall see, but I’ll carry on using the French thing.
So, “~(p&~p)” is “It is not the case that I am French and I am not French”.
You got that people? After testing we should be able to write this in its “absolute” form of “It cannot be the case that I am French and I am not French”.
Lets test this theory in the real world then.
Since we only have one variable (p) this vastly simplifies things. Either “p” is the case, or “p” is not the case, ie. “I am French” or “I am not French”.
So, we write:
p
-
T
F
and this summarises all the possible combinations of the truth value of the statement “p”, ie. it can be True (T) or it can be False (F). Pretty damn simple, no?
Lets add the law in then, and work out how those truth values would effect the truth value of the law.
The left hand bit represents the possible states of affairs in the world then, and the right hand bit shows how those possible states of affairs will affect the truth value of the law.
p | ~(p&~p)
-----------
T |
F |
First things first, lets copy over the truth value for “p”.
p | ~(p&~p)
-----------
T | T T
F | F F
Second, there is a negation for the second “p” so lets invert those truth values (swap T for F, and F for T).
I’ll put these values next to the original ones, under the “~” symbol.
p | ~(p&~p)
-----------
T | T FT
F | F TF
We now have the values either side of the “&”. So, if they are both true, we can mark the “&” as true, if not it is false.
As this is the value of the whole area in brackets, I’ll place these truth values in brackets.
p | ~(p&~p)
-----------
T | T(F)FT
F | F(F)TF
So, the statement “p&~p” is always false regardless of the truth value of “p”. If we add the negation that applies to all the stuff in brackets however… (ive put the final result in square brackets)
p | ~(p&~p)
-----------
T | [T]T(F)FT
F | [T]F(F)TF
We see that the whole statement is always true. Regardless of whether “p” is true or false, the law of non-contradiction is true.
This is what makes the law of non-contradiction a law, it is always true, and although this statement doesnt tell me alot about “p”, it does tell me what the structure of the world is like.
In other words, although the statement “It cannot be the case that I am French and I am not French” doesnt tell me whether I am French or not, it does tell that I cant be both at once.
That is one sexy bit of logic.
Try it yourself and find your own laws; ie. PL statements that are always true regardless of the truth value of the constituent statements.
Cheers!