Explore >> Select a destination
|
You are here 
|
jdh.hamkins.org | ||
| | | | |
www.logicmatters.net
|
|
| | | | | A standard menu for a first mathematical logic course might be something like this: (1) A treatment of the syntax and semantics of FOL, presenting a proof system or two, leading up to a proof of a Gödel's completeness theorem (and then a glance at e.g. the compactness theorem and some initial implications). (2) An [...] | |
| | | | |
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... | |
| | | | |
neilmadden.blog
|
|
| | | | | I saw another article on Gödel's incompleteness theorems linked from Reddit today. It's a topic I've wanted to write about for some time. Although many articles do a decent job in giving an idea of what the big deal is (and this one is pretty good), they can sometimes give a misleading impression of what... | |
| | | | |
jepsen.io
|
|
| | | |||
