In foundational theories of mathematics, the following kind of proposition is true but unprovable: Theorems are enumerable by an algorithm. See the foll

In foundational theories of mathematics, the following kind of proposition is true but unprovable: Theorems are enumerable by an algorithm. See the following article and associated video: https://papers.ssrn.com/abstract=3603021 https://papers.ssrn.com/abstract=3603021 https://www.youtube.com/watch?v=AJP1VL7shiI 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.