Le 04-avr.-06, à 10:40, Bruno Marchal a écrit :
> For example: (x)(0 s(x)) can be replaced by Ey((x)(y s(x) & (z)
Mmh... You are asked to imagine the symbol for "not equal" between the
0 and the s(x), and between the y and s(x). It does not print well!
Sorry.
Bruno
http://iridia.ulb.ac.
Le 03-avr.-06, 14:46, LISP a crit :
>
> Has anybody read Godel's orginal proof before.
>
> http://en.wikipedia.org/wiki/
> Original_proof_of_G%C3%B6del%27s_completeness_theorem
A long time ago I take a look on it.
>
> The above proof sketch is partial.
>
> Like most computer scientists,
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 Henki
3 matches
Mail list logo
