Explore >> Select a destination
|
You are here 
|
davmac.wordpress.com | ||
| | | | |
pointersgonewild.com
|
|
| | | | | Static vs Dynamic: Why not Both? | |
| | | | |
programmingmadecomplicated.wordpress.com
|
|
| | | | | There are these things that, depending on your definition, many or all programming languages use: 'types'. There's also a rich mathematical study of types in Type Theory which, along with related disciplines, has many connections to logic and proof. Why? Often, they take the form of explicit 'annotations' to program artefacts, big and small. For... | |
| | | | |
weblog.raganwald.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... | ||
