Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on What Gödel Discovered. Parent comment
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 and 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.
There are no comments on this comment yet.
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 and https://papers.ssrn.com/abstract=3457802