数理逻辑（第2版） [Mathematical Logic] 下载 mobi epub pdf 电子书 2024

☆☆☆☆☆
简体网页||繁体网页



点击这里下载

类似图书 点击查看全场最低价

---

编辑推荐

　　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.
　　Godels incompleteness theorems are presented in connection with several related results (such as Trahtenbrots 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

内容简介

　　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 Godels 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)

内页插图

目录

Preface
PART A
ⅠIntroduction
1.An Example from Group Theory
2.An Example from the Theory of Equivalence Relations
3.A Preliminary Analysis
4.Preview
Ⅱ 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
Ⅲ 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
6.Some simple formalizations
7.Some remarks on Formalizability
8.Substitution
Ⅳ A Sequent Calculus
1．Sequent Rules
2．Structural Rules and Connective Rules
3．Derivable Connective Rules
4．Quantifier and Equality Rules
5．Further Derivable Rules and Sequents
6．Summary and Example
7．Consistency
ⅤThe Completeness Theorem
1．Henkin’S Theorem．
2． Satisfiability of Consistent Sets of Formulas（the Countable Casel
3． Satisfiability of Consistent Sets of Formulas（the General Case）
4．The Completeness Theorem
Ⅵ The LSwenheim-Skolem and the Compactness Theorem
1．The L6wenheim-Skolem Theorem．
2．The Compactness Theorem
3．Elementary Classes
4．Elementarily Equivalent Structures
Ⅶ The Scope of First-Order Logic
1．The Notion of Formal Proof
2．Mathematics Within the Framework of Fimt—Order Logic
3．The Zermelo-Fraenkel Axioms for Set Theory．
4．Set Theory as a Basis for Mathematics
Ⅷ Syntactic Interpretations and Normal Forms
1．Term-Reduced Formulas and Relational Symbol Sets
2．Syntactic Interpretations
3．Extensions by Definitions
4．Normal Forms
PART B
Ⅸ Extensions of First-order logic
Ⅹ Limitations of the Formal Method
Ⅺ Free Models and Logic Programming
Ⅻ An Algebraic Characterization of Elementary Equivalence
ⅩⅢ Lindstrom’s Theorems
References
Symbol Index
Subject Index

前言/序言

数理逻辑（第2版） [Mathematical Logic] 下载 mobi epub pdf txt 电子书 格式

评分☆☆☆☆☆

数学经典书籍，值得学习

评分☆☆☆☆☆

1847年，英国数学家布尔发表了《逻辑的数学分析》，建立了“布尔代数”，并创造一套符号系统，利用符号来表示逻辑中的各种概念。布尔建立了一系列的运算法则，利用代数的方法研究

评分☆☆☆☆☆

本书从经典的一阶语言开始，详细介绍以数理逻辑进行的推导和证明，之后少量介绍为解决一阶语言不足而扩展的二阶语言。书中大量的推导证明过程，丰富的实例和练习，是进行头脑体操的好教材。对于数学不感兴趣的人，这本书有些枯燥，但是如果是数学和人工智能专业的高手，肯定会喜欢这本书所提供的知识。

评分☆☆☆☆☆

经典教材很喜欢，英文影印版，很清晰

评分☆☆☆☆☆

好书

评分☆☆☆☆☆

经典书籍

评分☆☆☆☆☆

买的时候没注意是英文版的。英语欠费有点麻烦。

评分☆☆☆☆☆

简而言之，数理逻辑就是精确化、数学化的形式逻辑。它是现代计算机技术的基础。新的时代将是数学大发展的时代，而数理逻辑在其中将会起到很关键的作用。

评分☆☆☆☆☆

本书从经典的一阶语言开始，详细介绍以数理逻辑进行的推导和证明，之后少量介绍为解决一阶语言不足而扩展的二阶语言。书中大量的推导证明过程，丰富的实例和练习，是进行头脑体操的好教材。对于数学不感兴趣的人，这本书有些枯燥，但是如果是数学和人工智能专业的高手，肯定会喜欢这本书所提供的知识。

类似图书 点击查看全场最低价