Inferential undecidablity is that not every proposition can be proved or disproved in the most powerful foundational theories. For example, the proposition Ha

Inferential undecidablity is that not every proposition can be proved or disproved in the most powerful foundational theories. For example, the proposition Halt[e] means that evaluation of the expression e halts. It is not the case for every expression e that the following holds: *Halt*[e} is provable or not *Halt*[e] is provable. Inferential incompleteness is that there are true propositions in a foundational theories can cannot be proved. For example, the following proposition is true but unprovable: Theorems can be enumerated. See the following for more information: https://papers.ssrn.com/abstract=3603021 https://papers.ssrn.com/abstract=3603021