State[ment]vetse – state – 1F2
If GOD is Complete, GOD is inconsistent. If GOD is incomplete but consistent, GOD is Not GOD.
The GOD, The Absolute:
1). Every statement has ‘Not’ or ‘Not-statement’.
2). Any statement A is a ‘Not’ or Not-statement of any ‘other’ statement B. (So any B or C or statement is just Not-A, or NA in short)
[Any A is the Contradiction of B, the ‘Not’ of A, i.e. NA.]
[CONTRADICTION is the KEY]
This is what actually leads to, and this is why, and this is the reason why Gödel’s incompleteness theorem exists.
Here are Gödel’s incompleteness theorem. These are mathematical theorems that relate to the philosophy in mathematics and to mathematical logic.
First Incompleteness Theorem: “Any consistent formal system F within which a certain amount of elementary arithmetic can be carried out is incomplete; i.e., there are statements of the language of F which can neither be proved nor disproved in F.” (Raatikainen 2015)
Gödel’s 1st Incompleteness theoremSecond Incompleteness Theorem: “Assume F is a consistent formalized system which contains elementary arithmetic. Then {displaystyle Fnot vdash {text{Cons}}(F)}.” (Raatikainen 2015)
Gödel’s 2nd Incompleteness theorem
Gödel’s 2nd Incompleteness theoremTherefore, ‘GOD’ cannot be complete without being inconsistent or contradictory. GOD cannot be GOD, without CONTRADICTION.
Comments
Post a Comment