Godel's original proof of completeness

From: LISP <yc43.domain.name.hidden>
Date: Mon, 03 Apr 2006 05:46:59 -0700

Has anybody read Godel's orginal proof before.


The above proof sketch is partial.

Like most computer scientists, I was only educated to learn
Henkin's proof.

One thing I dont understand. It is obvious that Henkin's
proof relies on constants (to deal with the quantifiers), but
Godel's proof starts with a version of predicate calculus
(called Restricted Functional Calculus) without constants at all.

Does anybody understand why constants are not essential
in Godel's?

Why can I find the material to show RFC to be equivalent
to the Predicate Calc with constants? Note that the wikipedia
sketch has this argument missing as "(to be written)".

You received this message because you are subscribed to the Google Groups "Everything List" group.
To post to this group, send email to everything-list.domain.name.hidden
To unsubscribe from this group, send email to everything-list-unsubscribe.domain.name.hidden
For more options, visit this group at http://groups.google.com/group/everything-list
Received on Mon Apr 03 2006 - 08:48:01 PDT

This archive was generated by hypermail 2.3.0 : Fri Feb 16 2018 - 13:20:11 PST