Explore >> Select a destination

You are here

 pavpanchekha.com
Equal functions in ITT
| | blog.computationalcomplexity.org
Computational Complexity: Why did 1+1=2 take Russell and Whitehead 300 pages?
5.2 parsecs away

Travel
| | In my post about the myth that Logicians are crazy I mentioned in passing that Whitehead and Russell spend 300 pages proving 1+1=2 (but we...
| | www.twanvl.nl
Type theory with indexed equality - the theory
2.6 parsecs away

Travel
| |
| | azdavis.net
Terms, types, and functions
3.9 parsecs away

Travel
| | Various varieties of function in programming languages.
| | xorshammer.com
What Happens When You Iterate Gödel's Theorem? - XOR's Hammer
34.3 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...