Jacob on Foundations of mathematics

“Now Gödel's proof, Russell's original paradox, all these things, all stem from one common root which is inherent in all symbolic languages, including the language we use. ...the problem which dogs all formal systems, the problem of self-reference; that is, the language can be used to refer to sentences in the language. Indeed, between 1900 and 1910 Russell tried to forbid this, to say you cannot do mathematics if you can do that, and so he invented the theory of types. Of course, no sooner had he invented it than it turned up you could not do mathematics at all if you obeyed the theory of types. So then he had to put in an axiom of reducibility, which allows a certain amount of self-reference. And by this time everyone was pretty bored.”

“The world is totally connected. Whatever explanation we invent at any moment is a partial connection, and its richness derives from the richness of such connections as we are able to make. ...mathematics suffer from the same partiality. Gödel, Turing, and Tarski all proved this. Gödel proved that you cannot have a complete axiomatization of the whole of mathematics, that every system which you devise is partial and suffers from one great shortcoming. If it is consistent, there are theorems which are true that cannot be proved in it. And Turing showed that every machine that we can devise is like a formal system, and that therefore no machine can do all of mathematics. And Tarski put it even more boldly when he said that no universal language for all of science can exist in all cases without paradox.”