Explore >> Select a destination


You are here

unstableontology.com
| | www.cs.uic.edu
2.7 parsecs away

Travel
| |
| | xorshammer.com
3.0 parsecs away

Travel
| | 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...
| | daniellefong.com
4.2 parsecs away

Travel
| | 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...
| | qchu.wordpress.com
23.8 parsecs away

Travel
| Let $latex k$ be a commutative ring. A popular thing to do on this blog is to think about the Morita 2-category $latex \text{Mor}(k)$ of algebras, bimodules, and bimodule homomorphisms over $latex k$, but it might be unclear exactly what we're doing when we do this. What are we studying when we study the Morita...