Mathematical Logic
291
Pagini
1994
An
Hardcover
Copertă
Descriere
Our first goal is Godel's completeness theorem, which shows that the con sequence relation coincides with formal provability: By means of a calcu lus consisting of simple formal inference rules, one can obtain all conse quences of a given axiom system (and in particular, imitate all mathemat ica...
Our first goal is Godel's completeness theorem, which shows that the con sequence relation coincides with formal provability: By means of a calcu lus consisting of simple formal inference rules, one can obtain all conse quences of a given axiom system (and in particular, imitate all mathemat ical proofs).
Conectează-te pentru a lăsa o recenzie
Nicio recenzie încă
Fii primul care lasă o impresie.