You ought to be careful when combining absolutes with words like true, false and not. The mixture is trickier than you might think.
Here’s a brain teaser to illustrate my point.
“There is no absolute truth”
You might have heard this statement before, and you might even hold it to be true at face value. I personally think it is very carelessly phrased: if we hold it to be true, then we must draw the logical conclusion to which it leads us: the statement that there is no absolute truth cannot be an absolute truth either. Postulating that absolute truth does not exist implies the possibility of its existence.
An answer to this paradox might be found in the first principle of René Descartes, a 17th century French philosopher:
Cogito, ergo sum
I think, therefore I am
It implies that there is at least one absolute truth out there, that of one’s existence, since doubting your own existence implies the existence of a medium where the thought of doubt is occurring, which is yourself. It gets geekier dear reader, keep reading.
If we go further down the road, we might lead ourselves out of philosophy land and into computer science territory: TRUE, FALSE, and logical operators like AND, OR and NOT are in fact the cornerstone of modern technology in the broad sense: phones, cars, SpaceX rockets, particle accelerators and anything in between rely on some kind of computing capacity, which is built on top of FALSE and TRUE values and logic operators, through a specific algebra, the Boolean algebra, into microprocessors. Wait wait wait wait! Don’t rush through the door. I know I just said algebra, but I also mentioned Boolean which is the fun part.
Boolean algebra is a binary or base 2 algebra. This means that you can only use two figures, 0 and 1, to represent all numbers from 0 to infinity. The numbers 0 and 1 are still written as 0 and 1 in binary but 2 can only be represented as 10, 3 thus becomes 11 and 4 is written as…100. Any decimal number becomes a sequence of zeros and ones in binary mode, and all that computers do is storing these zeros and ones in their memory registers as representations of the TRUE and FALSE values of the Boolean algebra, and perform operations on them: AND which is equivalent to a multiplication, OR, which is equivalent to a sum and NOT, which is equivalent to an opposite, among other operators.
For example, NOT(1) is always 0 and never 1, or in other words, NOT (TRUE) always yields FALSE, never TRUE.
Which could be a way of saying that the statement “There is no absolute truth” is always false, never true, at least as far as computers are concerned. Wouldn’t you agree?
Let the board sound