Talk:Gödel's completeness theorem

From Wikipedia, the free encyclopedia

You have new messages (last change).

Shouldn't the redirect be the other way around ? User:TraxPlayer

[edit] Equivalence to ultrafilter lemma

When you want to claim two theorems of ZFC are equivalent, you need to specify what weaker theory they are equivalent over. Every pair of theorems ZFC is (trivially) provably equivalent over ZFC. So for example, the ultrafilter lemma and the statement 1 + 1 = 2 are equivalent over ZFC.

Also, could somebody give me (in the discussion) a quick sketch of that proof? I don't see it offhand. I suppose that you need something to do the Henkin construction; is that it?

Retrieved from "http://en.wikipedia.org../../../g/%C3%B6/d/Talk%7EG%C3%B6del%27s_completeness_theorem_9374.html"