Explore >> Select a destination
|
You are here 
|
xorshammer.com | ||
| | | | |
unstableontology.com
|
|
| | | | | (note: one may find the embedded LaTeX more readable on LessWrong) The Löwenheim-Skolem theorem implies, among other things, that any first-order theory whose symbols are countable, and which has an infinite model, has a countably infinite model. This means that, in attempting to refer to uncountably infinite structures (such as in set theory), one "may... | |
| | | | |
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... | |
| | | | |
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 [...] | |
| | | | |
boldandgreen.wordpress.com
|
|
| | | I tried a new background color for my windows as shown here. Instead of the light grey suggested, I picked a very light brown: R 230 Y 222 B 188 (as shown on picture). The best thing is to change the background in Word first and test the color. | ||
