/explore
|
You are here 
|
daniellefong.com | ||
| | | | |
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. |
|
| | | | | ||
| | | | |
jeremykun.wordpress.com
We assume the reader is familiar with the concepts of determinism and finite automata, or has read the corresponding primer on this blog. The Mother of All Computers Last time we saw some models for computation, and saw in turn how limited they were. Now, we open Pandrora's hard drive: Definition: A Turing machineis a... |
|
| | | | | ||
| | | | |
unstableontology.com
(note: one may find the embedded LaTeX more readable on LessWrong) The Löwenheim-Skolem theorem implies, among other things, that any first-order theory whose symbols are countable, and which has an infinite model, has a countably infinite model. This means that, in attempting to refer to uncountably infinite structures (such as in set theory), one "may... |
|
| | | | | ||
| | | | |
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. |
|
| | | |||
