|
You are here |
unstableontology.com | ||
| | | | |
xorshammer.com
|
|
| | | | | Let $latex \mathrm{PA}$ be Peano Arithmetic. Gödel's Second Incompleteness Theorem says that no consistent theory $latex T$ extending $latex \mathrm{PA}$ can prove its own consistency. (I'll write $latex \mathrm{Con}(T)$ for the statement asserting $latex T$'s consistency; more on this later.) In particular, $latex \mathrm{PA} + \mathrm{Con}(\mathrm{PA})$ is stronger than $latex \mathrm{PA}$. But certainly, given that... | |
| | | | |
www.cs.uic.edu
|
|
| | | | | ||
| | | | |
www.lesswrong.com
|
|
| | | | | A community blog devoted to refining the art of rationality | |
| | | | |
thehousecarpenter.wordpress.com
|
|
| | | NB: I've opted to just get straight to the point with this post rather than attempting to introduce the subject first, so it may be of little interest to readers who aren't already interested in proving the completeness theorem for propositional logic. A PDF version of this document is available here. The key thing I... | ||