点击选择搜索分类
首页 - 摄影- 正文
☆☆☆☆☆
||
[德] 艾宾浩斯 著
出版社: 世界图书出版公司 ISBN:9787506292276 版次:1 商品编码:10096474 包装:平装 外文名称:Mathematical Logic 开本:24开 出版时间:2008-05-01 用纸:胶版纸 页数:289 正文语种:英语
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
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)
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
数理逻辑(第2版) [Mathematical Logic]-so88
数理逻辑(第2版) [Mathematical Logic] pdf epub mobi txt 电子书 下载 2022
图书介绍
☆☆☆☆☆
||
[德] 艾宾浩斯 著
出版社: 世界图书出版公司 ISBN:9787506292276 版次:1 商品编码:10096474 包装:平装 外文名称:Mathematical Logic 开本:24开 出版时间:2008-05-01 用纸:胶版纸 页数:289 正文语种:英语
编辑推荐
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)
内页插图
目录
PrefacePART 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
电子书下载地址:
相关电子书推荐:
- 文件名
- 失衡:为什么我们无法摆脱肥胖与慢性病
- 汉语阿拉伯语词典(上下修订版)(精)
- 可操作的地震预测预报
- 地球旅馆·市集
- 科技发展五十年 汽车发展新时代
- 新民说 法辨:法律文化论集
- 家庭健康宝典
- 三级口译全国翻译资格水平考试 英语口译实务3级 教材+配套训练+常用词语词汇+综合能力全套6册
- {RT}宇宙深处:探索宇宙的过去与未来:增补版-金斯,吕德生,王蓓 石油工业出版社 978
- 托福写作高分范文 托福小红书系列 谢侃
- 科普供给侧的革命 9787504676320
- 现货速发中 延世韩国语 教材1-2+活用练习1-2 全4册 韩国延世大学经典教材系列 附光盘
- 灵光:改变科技进程的20大智慧瞬间
- 新闻传播学研究生入学考试参考书:文史要览(第2版)
- 中国科技典籍选刊(第二辑):历引三种 李亮