Explore >> Select a destination
|
You are here 
|
unstableontology.com | ||
| | | | |
www.lesswrong.com
|
|
| | | | | The Löwenheim-Skolem theorem implies, among other things, that any first-order theory whose symbols are countable, and which has an infinite model, h... | |
| | | | |
daniellefong.com
|
|
| | | | | The following occurred to me on a run about two years ago: It's not given much press, but the the Halting Problem is intimately related to Gödel's First Incompleteness Theorem. Indeed it produces it as a correllary. Historically, Gödel's incompleteness results were proved by hacking arithmetic into a Turing complete system, and this is still... | |
| | | | |
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... | |
| | | | |
tangietwoods.blog
|
|
| | | https://www.youtube.com/watch?v=fmpshXiCVis | ||
