基本信息·出版社：世界图书出版公司 ·页码：289 页 ·出版日期：2008年05月 ·ISBN：7506292270/9787506292276 ·条形码：9787506292276 ·版本：第1版 ...
| 商家名称 |
信用等级 |
购买信息 |
订购本书 |
|
|
 |
数理逻辑(第2版) |
 |
|
|
数理逻辑(第2版) |
|
基本信息·出版社：世界图书出版公司
·页码：289 页
·出版日期：2008年05月
·ISBN：7506292270/9787506292276
·条形码：9787506292276
·版本：第1版
·装帧：平装
·开本：32
·正文语种：英语
·外文书名：Mathematical Logic
内容简介 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)
编辑推荐 A short digression into model theory will help us to analyze the expressive power of the first-order language, and it will turn out that there are certain deficiencies. For example, the first-order language does not allow the formulation of an adequate axiom system for arithmetic or analysis. On the other hand, this di~culty can be overcome——-even in the framework of first-order logic——by developing mathematics in set-theoretic terms. We explain the prerequisites from set theory necessary for this purpose and then treat the subtle relation between logic and set theory in a thorough manner.
Godel's incompleteness theorems are presented in connection with several related results (such as Trahtenbrot's theorem) which all exemplify the limitatious of machine-oriented proof methods. The notions of computability theory that are relevant to this discussion are given in detail. The concept of computability is made precise by means of the register machine as a
目录 Preface
PART A
I Introduction
1.An Example from Group Theory
2.An Example from the Theory of Equivalence Relations
3.A Preliminary Analysis
4.Preview
II Syntax of First-Order Languages
1.Alphabets
2.The Alphabet of a First-Order Language
3.Terms and Formulas in First-Order Languages
4.Induction in the Calculus of Terms and in the Calculus of Formulas
5.Free Variables and Sentences
III Semantics of First-Order Languages
1.Structures and Interpretations
2.Standardization of Connectives
3.The Satisfaction Relation
4.The Consequence Relation
5.Two Lemmas on the Satisfaction Relation
…………
……
