/explore
|
You are here 
|
blog.sigfpe.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.lesswrong.com
|
|
| | | | | The Löwenheim-Skolem theorem implies, among other things, that any first-order theory whose symbols are countable, and which has an infinite model, h... | |
| | | | |
qchu.wordpress.com
|
|
| | | In this post we'll describe the representation theory of theadditive group scheme$latex \mathbb{G}_a$ over a field $latex k$. The answer turns out to depend dramatically on whether or not $latex k$ has characteristic zero. Preliminaries over an arbitrary ring (All rings and algebras are commutative unless otherwise stated.) The additive group scheme $latex \mathbb{G}_a$ over... | ||
