Has anybody read Godel's orginal proof before. http://en.wikipedia.org/wiki/Original_proof_of_G%C3%B6del%27s_completeness_theorem
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@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/everything-list -~----------~----~----~----~------~----~------~--~---
