[MD] MOQ and Gödel's incompleteness theorems
Tuukka Virtaperko
mail at tuukkavirtaperko.net
Tue Mar 8 00:26:42 PST 2011
It would be rather simple to argue that the dynamic-static-division in
MOQ is some sort of an informal application of Gödel's incompleteness
theorems. According to these theorems, any sufficiently powerful logical
system cannot prove it's own completeness unless it is inconsistent. And
if a system cannot prove it's own completeness, there are statements in
the system which cannot be proven true or false. Some sources
(Wikipedia, "Gödel, Escher, Bach: An Eternal Golden Braid") claim that
these statements are true but unprovable, but I'm under the impression
that this is not the case. Instead, their truth value cannot be
determined. If others are in doubt, I can investigate this further.
What happens if you change "true" and "false" into "good" and "evil"? A
"logical system" turns into an intellectual static value pattern, and an
unprovable statement turns into an act whose moral value cannot be
determined from within the system. And if the act is good, it is Dynamic
Quality. This is MOQ. Right?
-Tuukka
More information about the Moq_Discuss
mailing list