Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Poincaré, Heisenberg, Gödel and the limits of scientific knowledge.
kind of proposition is true but unprovable:
Theorems are enumerable by an algorithm.
https://papers.ssrn.com/abstract=3603021
https://www.youtube.com/watch?v=AJP1VL7shiI
In foundational theories, the proposition
I'mUnprovable (used in the proof in [Gödel 1931]) does not
exist because of restrictions on orders of propositions that
were introduced by Bertrand Russell to prevent logical
contradictions in mathematics.
There are no comments on this comment yet.
kind of proposition is true but unprovable:
See the following article and associated video:https://papers.ssrn.com/abstract=3603021
https://www.youtube.com/watch?v=AJP1VL7shiI
In foundational theories, the proposition
I'mUnprovable (used in the proof in [Gödel 1931]) does not
exist because of restrictions on orders of propositions that
were introduced by Bertrand Russell to prevent logical
contradictions in mathematics.