Y
YHWH_Christ
Guest
Gödel’s incompleteness theorems state:
andAny 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 ."
Gödel demonstrated these theorems through his genius of Gödel numbering which can be done in an infinite amount of ways (Gödel uses unique prime factorization to demonstrate this) and essentially makes them become self referential, i.e. if a formal system is consistent (all statements in the system are provable within the system) then there must exist a statement from the generated strings which is not provable, thus its provability demonstrates it unprovability making it incomplete. This means there are statements, such as 0+1=1 is true, that are true but which cannot be proven except within themselves. Would this then imply at least Mathematical Platonism?"Assume F is a consistent formalized system which contains elementary arithmetic. Then {\displaystyle F\not \vdash {\text{Cons}}(F)}
Last edited: