Outer Web | Explore

Explore >> Select a destination

You are here		m-phi.blogspot.com How Might PA be Inconsistent?
\|	\|	xorshammer.com What Happens When You Iterate Gödel's Theorem? - XOR's Hammer	4.2 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...	4.2 parsecs away Travel
\|	\|	gowers.wordpress.com When is proof by contradiction necessary? \| Gowers's Weblog	4.0 parsecs away Travel
\|	\|	It's been a while since I have written a post in the "somewhat philosophical" category, which is where I put questions like "How can one statement be stronger than an another, equivalent, statement?" This post is about a question that I've intended for a long time to sort out in my mind but have found...	4.0 parsecs away Travel
\|	\|	jdh.hamkins.org Every function can be computable! \| Joel David Hamkins	4.3 parsecs away Travel
\|	\|	I'd like to share a simple proof I've discovered recently of a surprising fact: there is a universal algorithm, capable of computing any given function! Wait, what? What on earth do I ...	4.3 parsecs away Travel
\|	\|	yotam.net Why Static Typing · Yotam's blog	25.2 parsecs away Travel
\|		A blog about free software and programming	25.2 parsecs away Travel