☆☆☆☆☆




點擊這裡下載

類似圖書 點擊查看全場最低價

---

編輯推薦

　　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 電子書

評分☆☆☆☆☆

非常好用的産品！活動價格非常劃算！非常好用的産品！活動價格非常劃算！非常好用的産品！活動價格非常劃算！效果好！！下次還會再來！非常好用的産品！活動價格非常劃算！非常好用的産品！活動價格非常劃算！非常好用的産品！活動價格非常劃算！效果好！！下次還會再來！非常好用的産品！活動價格非常劃算！非常好用的産品！活動價格非常劃算！非常好用的産品！活動價格非常劃算！效果好！！下次還會再來！非常好用的産品！活動價格非常劃算！非常好用的産品！活動價格非常劃算！非常好用的産品！活動價格非常劃算！效果好！！下次還會再來！非常好用的産品！活動價格非常劃算！非常好用的産品！活動價格非常劃算！非常好用的産品！活動價格非常劃算！效果好！！下次還會再來！非常好用的産品！活動價格非常劃算！非常好用的産品！活動價格非常劃算！非常好用的産品！活動價格非常劃算！效果好！！下次還會再來！

評分☆☆☆☆☆

書的裝幀的製定還可以，英文版也很實惠

評分☆☆☆☆☆

十九世紀末二十世紀初，數理邏輯有瞭比較大的發展，1884年，德國數學傢弗雷格齣版瞭《數論的基礎》一書，在書中引入量詞的符號，使得數理邏輯的符號係統更加完備。對建立這門學科做齣貢獻的，還有美國人皮爾斯，他也在著作中引入瞭邏輯符號。從而使現代數理邏輯最基本的理論基礎逐步形成，成為一門獨立的學科。 數理邏輯包括哪些內容呢？這裏我們先介紹它的兩個最基本的也是最重要的組成部分，就是“命題演算”和“謂詞演算”。

評分☆☆☆☆☆

發展

評分☆☆☆☆☆

産生

評分☆☆☆☆☆

數理邏輯又稱符號邏輯、理論邏輯。它既是數學的一個分支，也是邏輯學的一個分支。是用數學方法研究邏輯或形式邏輯的學科。其研究對象是對證明和計算這兩個直觀概念進行符號化以後的形式係統。數理邏輯是數學基礎的一個不可缺少的組成部分。雖然名稱中有邏輯兩字，但並不屬於單純邏輯學範疇。

評分☆☆☆☆☆

本書從經典的一階語言開始，詳細介紹以數理邏輯進行的推導和證明，之後少量介紹為解決一階語言不足而擴展的二階語言。書中大量的推導證明過程，豐富的實例和練習，是進行頭腦體操的好教材。對於數學不感興趣的人，這本書有些枯燥，但是如果是數學和人工智能專業的高手，肯定會喜歡這本書所提供的知識。

評分☆☆☆☆☆

邏輯一下子

評分☆☆☆☆☆

紙張精美 摸上去手感質量很好 知識點豐富 一看就很喜歡呀

類似圖書 點擊查看全場最低價

查看全網最低價