Explore >> Select a destination
|
You are here 
|
www.cs.uic.edu | ||
| | | | |
unstableontology.com
|
|
| | | | | (note: some readers may find the LaTeX more readable on LessWrong.) In this post I prove a variant of Gödel's completeness theorem. My intention has been to really understand the theorem, so that I am not simply shuffling symbols around, but am actually understanding why it is true. I hope it is helpful for at... | |
| | | | |
billwadge.com
|
|
| | | | | The famous mathematician Kurt Gödel proved two "incompleteness" theorems. This is their story. By the 1930s logicians, especially Tarski, had figured out the semantics of predicate logic. Tarski described what exactly was an 'interpretation' and what it meant for a formula to be true in an interpretation. Briefly, an interpretation is a nonempty set (the... | |
| | | | |
rjlipton.com
|
|
| | | | | We must know. We will know---David Hilbert Mihai Prunescu is at the Institute of Mathematics of the Romanian Academy. He works in logic and complexity theory. We recently discussed his work on Hilbert's Tenth. Today we thought we would do a follow up discussion of a recent paper of his on the famous Hilbert's Tenth... | |
| | | | |
clutterreport.wordpress.com
|
|
| | | attempting to clean up my living and workspace | ||
