Incompleteness in the sense of inferential undecidability still must be proven for higher-order strongly-typed theories in computer science. For an example of

Incompleteness in the sense of inferential undecidability still must be proven for higher-order strongly-typed theories in computer science. For an example of such as proof see the following: https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3459566 https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3459566