数理逻辑
世界图书出版公司 / 2008-5出版
简介

《数理逻辑(第2版)》主要内容:What is a mathematical proof? How can proofs be justified? Are there limitations to provability? To what extent can machines carry out mathematical proofs?Only in this century has there been success in obtaining substantial and satisfactory answers. The present book contains a systematic discussion of these results. The investigations are centered around first-order logic. Our first goal is' Godel's completeness theorem, which shows that the consequence relation coincides with formal provability: By means of a calculus consisting of simple formal inference rules, one can obtain all consequences of a given axiom system (and in particular, imitate all mathematical proofs)

喜欢这本书的人也喜欢 打开App查看更多
  • 数理逻辑
  • Set Theory
  • Model Theory
  • 几何不变量理论

打开App,看全部书评