Godel's incompleteness theorem and quantum theory. Modern mathematics holds the view that the G-sentence is true in some models (notably the standard model) and false in others.
— Arisktotle
Who? Which model?
From Wikipedia, Gödels incompleteness theorems:
Although the Gödel sentence of a consistent theory is true as a statement about the intended interpretation of arithmetic, the Gödel sentence will be false in some nonstandard models of arithmetic, as a consequence of Gödel's completeness theorem (Franzén 2005, p. 135). That theorem shows that, when a sentence is independent of a theory, the theory will have models in which the sentence is true and models in which the sentence is false. As described earlier, the Gödel sentence of a system F is an arithmetical statement which claims that no number exists with a particular property. The incompleteness theorem shows that this claim will be independent of the system F, and the truth of the Gödel sentence follows from the fact that no standard natural number has the property in question. Any model in which the Gödel sentence is false must contain some element which satisfies the property within that model. Such a model must be "nonstandard" – it must contain elements that do not correspond to any standard natural number (Raatikainen 2015, Franzén 2005, p. 135).
Since some essential "reflective" information was not passed on from the model to the formal system, it couldn't decide the outcome.
— Arisktotle
Again: Which model?
Then again, formal systems actually lack the tool required to receive that information and we would have to conclude that Gödels concept simply cannot be completely coded into the language of the formal system.
— Arisktotle
No, no... The sentence could be coded into the all-system. It just blew up then.
Note that the latter citations constitute
my view as indicated in the comment. This is not standard mathematical stuff but something I have been working on for a while. For instance, I doubt the all-system will be capable of handling new definitions for function domains and co-domains necessary to be compatible with mature human logic.