/explore
|
You are here 
|
www.lesswrong.com | ||
| | | | |
dvt.name
In the previous blog post in this series, we looked at Gödel's First Incompleteness Theorem, and came to the amazing conclusion that we can't compute certain kinds of functions in formal systems (like Javascript). Specifically, we looked at a special function, , which turned out to be non-computable. In case we forgot, the first incompleteness ... |
|
| | | | | ||
| | | | |
blog.sigfpe.com
[AI summary] The article explains why defining a truth predicate for set theory (ZF) is impossible despite the success of similar definitions in propositional calculus and Peano arithmetic, based on Tarski's theorem and the limitations of transfinite recursion when applied to infinite collections of children. |
|
| | | | | ||
| | | | |
nickdrozd.github.io
Goedel's first incompleteness theorem is the claim that any sound, consistent formal system of sufficient power is incomplete; that is, there are statements in the language of the system that can neither be proved nor disproved. Traditionally the theorem is proved by exhbiting a statement g which is provably equivalent to a statement encoding its own disprovability in the system S. |
|
| | | | | ||
| | | | |
www.logicmatters.net
I didn't at all intend to return to my Introduction to Gödel's Theorems (which I've not really read for a dozen years, apart from correcting a small handful of typos in the PDF). But I had occasion to look something up, and - hey, ho! - I've found myself over the last week beginning to [...] |
|
| | | |||
