An undergraduate's guide to the foundational theorems of logic How would you explain one of these theorems in the foundations of mathematics to a fellow colleague outside the field of logic (or rather to an undergraduate mathematics student) handwaving over the details?
The aforementioned link is by no means complete and following are some of the missing ones:


*

*Beth definability theorem

*Brouwer's fan theorem

*Craig interpolation theorem

*Mostowski collapse lemma

*Omitting types theorem

*Ramsey's theorem

*Shoenfield absoluteness theorem

*Tarski's undefinabilty theorem

*Vaught conjecture

*Well-ordering theorem
Due to the dearth of lucid papers on these topics -admittedly which is by no means easy to understand without pursuing years in college- my search has only yielded the following accounts:


*

*(The Cartoon Guide to) Löb's Theorem by Eliezer Yudkowsky

*Konig's infinity lemma 

*Zorns Lemma (Axiom of Choice)


I am hoping to get a better understanding in expository terms of these logical theorems. Any reference that sheds light targeting students who had at most an introductory symbolic logic course at college level (such as myself) would be appreciated.
 A: Edit: This answer was given to the original formulation of the question, which asked for five-minute explanations for laypersons met on the street, rather than handwavy introductions for undergraduates. Maybe it still works though.

Since I have only 5 minutes to tell a layperson, I'd channel the late George Boolos and explain the second incompleteness theorem using only one-syllable words (Mind 103, pp. 1-3).

First of all, when I say "proved", what I will mean is "proved with the aid of
the whole of math". Now then: two plus two is four, as you well know. And,
of course, it can be proved that two plus two is four (proved, that is, with the
aid of the whole of math, as I said, though in the case of two plus two, of
course we do not need the whole of math to prove that it is four). And, as
may not be quite so clear, it can be proved that it can be proved that two plus
two is four, as well. And it can be proved that it can be proved that it can be
proved that two plus two is four. And so on. In fact, if a claim can be proved,
then it can be proved that the claim can be proved. And that too can be
proved.
Now, two plus two is not five. And it can be proved that two plus two is not
five. And it can be proved that it can be proved that two plus two is not five,
and so on.
Thus: it can be proved that two plus two is not five. Can it be proved as well
that two plus two is five? It would be a real blow to math, to say the least, if
it could. If it could be proved that two plus two is five, then it could be
proved that five is not five, and then there would be no claim that could not
be proved, and math would be a lot of bunk.
So, we now want to ask, can it be proved that it can't be proved that two plus
two is five? Here's the shock: no, it can't. Or, to hedge a bit: if it can be
proved that it can't be proved that two plus two is five, then it can be proved
as well that two plus two is five, and math is a lot of bunk. In fact, if math is
not a lot of bunk, then no claim of the form "claim X can't be proved" can be
proved.
So, if math is not a lot of bunk, then, though it can't be proved that two plus
two is five, it can't be proved that it can't be proved that two plus two is five.
By the way, in case you'd like to know: yes, it can be proved that if it can be
proved that it can't be proved that two plus two is five, then it can be proved
that two plus two is five.

But if you were to start saying this to someone unsolicited, you might raise some eyebrows and be asked to leave the store or exit the bus. Proceed with care.
A: If you will accept a description by analogy, here is one for Craig's interpolation theorem: If there is a bridge needed to prove one statement from another, that bridge can be as narrow as the language which is shared by the two statements.
I don't know if the proof can be conveyed in a manner as accessible as the description.
Gerhard "Ask Me About System Design" Paseman, 2012.01.17
