In 1931, the young Kurt Godel published his First Incompleteness Theorem, which tells us that, for any sufficiently rich theory of arithmetic, there are some arithmetical truths the theory cannot prove. This remarkable result is among the most intriguing (and most misunderstood) in logic. Godel also outlined an equally significant Second Incompleteness Theorem. How are these Theorems established, and why do they matter? Peter Smith answers these questions by presenting an unusual variety of proofs for the First Theorem, showing how to prove the Second Theorem, and exploring a family of related results (including some not easily available elsewhere). The formal explanations are interwoven with discussions of the wider significance of the two Theorems. This book will be accessible to philosophy students with a limited formal background. It is equally suitable for mathematics students taking a first course in mathematical logic.

本书是“逻辑与形而上学教科书系列”中的一本。书中从零起点开始，介绍了集合论基本知识，命题逻辑、一阶逻辑的语法和语义，哥德尔完全性定理，递归论基本知识，简化版本的自然数模型，哥德尔不完全性定理等内容。 本书尤其面向对数学基础感兴趣的的读者。相对于其他数理逻辑教材，本书更强调逻辑与元数学的联系，更多地介绍语义部分，强调语法语义的统一。书中，除了对各个知识点本身的讲解，还介绍了它们的直观和思想背景。 本书适合作为数理逻辑系列课程的导论，并为后继课程做准备。为此，在最后一章中简单介绍了数理逻辑当代研究成果及其与本书内容的联系。希望读者掌握了本导论的内容之后有意于继续学习更深、更专门、更有意思的内容。 书中所含习题能使读者通过练习得到必要的训练，并自我检验对有关内容的理解。

《清华大学计算机系列教材:数理逻辑与集合论(第2版)》共12章，前8章介缗数理逻辑，包括命题和谓词逻辑的基本概念、等值和推理演算、公理系统、模型论和证明论。后4章介绍集合论，包括集合、关系、函数、实数集与基数。《清华大学计算机系列教材:数理逻辑与集合论(第2版)》可作为大学离散数学的教科书。也可供从事计算机科学、人工智能等方面的科技人员参考。

This introduction to first-order logic clearly works out the role of first-order logic in the foundations of mathematics, particularly the two basic questions of the range of the axiomatic method and of theorem-proving by machines. It covers several advanced topics not commonly treated in introductory texts, such as Fraisse's characterization of elementary equivalence, Lindstrom's theorem on the maximality of first-order logic, and the fundamentals of logic programming.

Here is an introductory textbook which is designed to be useful not only to intending logicians but also to mathematicians in general. Based on Dr Hamilton's lectures to third and fourth year undergraduate mathematicians at the University of Stirling it has been written to introduce student or professional mathematicians, whose background need cover no more than a typical first year undergraduate mathematics course, to the techniques and principal results of mathematical logic. In presenting the subject matter without bias towards particular aspects, applications or developments, an attempt has been made to place it in the context of mathematics and to emphasise the relevance of logic to the mathematician. Starting at an elementart level, the text progresses from informal discussion to the precise description and use of formal mathematical and logical systems. The early chapters cover propositional and predicate calculus. The later chapters deal with Godel's theorem on the incompleteness of arithmetic and with various undecidability and unsolvability results, including a discussion of Turing machines and abstract computability. Each section ends with exercises designed to clarify and consolidate the material in that section. Hints or solutions to many of these are provided at the end of the book. The revision of this very successful textbook includes new sections on Skolemisation and applying well-formed formulas to logic programming. Some corrections have been made and extra exercises added.

译自: Logic for mathematicans/A. G. Hamilton. -- 剑桥大学出版社, 1978

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)

This user-friendly introduction to the key concepts of mathematical logic focuses on concepts that are used by mathematicians in every branch of the subject. Using an assessible, conversational style, it approaches the subject mathematically (with precise statements of theorems and correct proofs), exposing readers to the strength and power of mathematics, as well as its limitations, as they work through challenging and technical results. KEY TOPICS: Structures and Languages. Deductions. Comnpleteness and Compactness. Incompleteness--Groundwork. The Incompleteness Theorems. Set Theory. : For readers in mathematics or related fields who want to learn about the key concepts and main results of mathematical logic that are central to the understanding of mathematics as a whole.

本书是著名数理逻辑哲学家王宪钧教授的代表作，共分三篇，前两篇“命题演算”和“狭谓词演算”，讲述数理逻辑基础知识。作者对基本概念的讲解、定理和无定理的证明都详细易懂，第三篇是关于数理逻辑发展的简史，作者论述了从莱布尼茨到歌德尔的数理逻辑发展的三个阶段，指出了数理逻辑的五个特点，并就一些重要的数学问题发表了自己的见解。本书内容涉及数学、哲学、逻辑学、语言学以及科学史等诸多问题。适用于哲学、数理工作者。

本书是数理逻辑方面的经典教材。书中涵盖了命题逻辑、一阶逻辑、不可判定性以及二阶逻辑等方面的内容，并且包含本书是数理逻辑方面的经典教材。书中涵盖了命题逻辑、一阶逻辑、不可判定性以及二阶逻辑等方面的内容，并且包含了与计算机科学有关的主题，如有限模型。本书特点是：内容可读性强；组织结构更灵活，授课教师可根据教学需要节选本书的内容；反映了近几年来理论计算机科学对逻辑学产生的影响；包含较多的示例和说明。本书适合作为计算机及相关专业本科生和研究生数理逻辑课程的教材。. 本书是数理逻辑方面的经典教材，以可读性强而著称，在美国大学中采用率极高，麻省理工学院、加州大学伯克利分校、哥伦比亚大学、康奈尔大学等众多名校均用它作为教材。本版章节组织更加灵活，增加了与计算机科学相关的主题(比如有限模型)，还增加了一些示例和阐释文字，更适合本科生和研究生数理逻辑课程使用。.