Model Theory formalizes the notion of "truth" in foundational mathematics of computer science. The axioms of powerful foundational theories of computer scien

Model Theory formalizes the notion of "truth" in foundational mathematics of computer science. The axioms of powerful foundational theories of computer science have just one model up to a unique isomorphism. See https://papers.ssrn.com/abstract=3418003 https://papers.ssrn.com/abstract=3418003 and https://papers.ssrn.com/abstract=3457802 https://papers.ssrn.com/abstract=3457802 The [Gödel 1930] "completeness theorem" is *false* for the foundational theories of Computer Science because these theories are inferentially incomplete, that is, not every proposition can be proved or disproved.