Assuming no previous study in logic, this informal yet rigorous text covers the material of a standard undergraduate first course in mathematical logic, using natural deduction and leading up to the completeness theorem for first-order logic. At each stage of the text, the reader is given an intuition based on standard mathematical practice, which is subsequently developed with clean formal mathematics. Alongside the practical examples, readers learn what can and can't be calculated; for example the correctness of a derivation proving a given sequent can be tested mechanically, but there is no general mechanical test for the existence of a derivation proving the given sequent. The undecidability results are proved rigorously in an optional final chapter, assuming Matiyasevich's theorem characterising the computably enumerable relations. Rigorous proofs of the adequacy and completeness proofs of the relevant logics are provided, with careful attention to the languages involved. Optional sections discuss the classification of mathematical structures by first-order theories; the required theory of cardinality is developed from scratch. Throughout the book there are notes on historical aspects of the material, and connections with linguistics and computer science, and the discussion of syntax and semantics is influenced by modern linguistic approaches. Two basic themes in recent cognitive science studies of actual human reasoning are also introduced. Including extensive exercises and selected solutions, this text is ideal for students in Logic, Mathematics, Philosophy, and Computer Science.

Is infinity a valid mathematical property or a meaningless abstraction? David Foster Wallace brings his intellectual ambition and characteristic bravura style to the story of how mathematicians have struggled to understand the infinite, from the ancient Greeks to the nineteenth-century mathematical genius Georg Cantor's counterintuitive discovery that there was more than one kind of infinity. Smart, challenging, and thoroughly rewarding, Wallace's tour de force brings immediate and high-profile recognition to the bizarre and fascinating world of higher mathematics.

【编辑推荐】
★ 美国天才作家大卫·福斯特·华莱士罕见历史作品；
★ 睿智、深刻，充满娱乐性和可读性的无穷大概念史；
★ 一段挑战抽象之抽象，挑战想象力极限的旅程。
【内容简介】
要穿过一条街道，必须先穿过街道的二分之一；要穿过街道的二分之一，必须先穿过它的四分之一，要穿过四分之一，必须……
自从芝诺提出二分悖论以来，“如何穿过一条街道”这个简单的问题竟然困扰了人类长达两千多年，薅秃了多少最顶尖的头脑，成为最抽象、最晦涩的数学概念。华莱士用自己标志性的奇思妙想、辛辣独特（絮絮叨叨）的文风，以及比正文还长的脚注，展现了这一段在街道中央徘徊的历史。他的文字如同无穷大这一数学概念一样，充满智慧。
【本书获誉】
“现代人驯服无穷大的迷人历史。”
——《纽约时报书评周刊》
“（华莱士）给他的书带来了令人耳目一新的对话风格，以及令人惊讶的数学权威性……一本成功的书。”
——美国学者约翰·艾伦·保罗
“令人震惊的可读性……对于枯燥的数学教科书和强调发现者而非发现本身的流行文化数学书籍来说，这都是一剂绝妙的解毒剂。”
——《书单》

Model theory deals with a branch of mathematical logic showing connections between a formal language and its interpretations or models. This is the first and most successful textbook in logical model theory. Extensively updated and corrected in 1990 to accommodate developments in model theoretic methods — including classification theory and nonstandard analysis — the third edition added entirely new sections, exercises, and references.
Each chapter introduces an individual method and discusses specific applications. Basic methods of constructing models include constants, elementary chains, Skolem functions, indiscernibles, ultraproducts, and special models. The final chapters present more advanced topics that feature a combination of several methods. This classic treatment covers most aspects of first-order model theory and many of its applications to algebra and set theory.

This book is a modern introduction to model theory which stresses applications to algebra throughout the text. The first half of the book includes classical material on model construction techniques, type spaces, prime models, saturated models, countable models, and indiscernibles and their applications. The author also includes an introduction to stability theory beginning with Morley's Categoricity Theorem and concentrating on omega-stable theories. One significant aspect of this text is the inclusion of chapters on important topics not covered in other introductory texts, such as omega-stable groups and the geometry of strongly minimal sets. The author then goes on to illustrate how these ingredients are used in Hrushovski's applications to diophantine geometry. David Marker is Professor of Mathematics at the University of Illinois at Chicago. His main area of research involves mathematical logic and model theory, and their applications to algebra and geometry. This book was developed from a series of lectures given by the author at the Mathematical Sciences Research Institute in 1998.

《模型论基础》介绍模型论的基础知识。主要内容有：紧致性定理，省略型定理，内播定理，完全理论与模型完全理论，初等键，越积，模型论力迫法，他和模型等。并附有模型论方法对经典数学应用的一些例子。《模型论基础》可供大学数学专业高年级学生及研究生、数学教师及数学工作者阅读。也可供其他专业有关数理逻辑及理论计算机科学方面的师生及科学工作者参考。

An Introduction to Proof Theory provides an accessible introduction to the theory of proofs, with details of proofs worked out and examples and exercises to aid the reader's understanding. It also serves as a companion to reading the original pathbreaking articles by Gerhard Gentzen. The first half covers topics in structural proof theory, including the Gödel-Gentzen translation of classical into intuitionistic logic (and arithmetic), natural deduction and the normalization theorems (for both NJ and NK), the sequent calculus, including cut-elimination and mid-sequent theorems, and various applications of these results. The second half examines ordinal proof theory, specifically Gentzen's consistency proof for first-order Peano Arithmetic. The theory of ordinal notations and other elements of ordinal theory are developed from scratch, and no knowledge of set theory is presumed. The proof methods needed to establish proof-theoretic results, especially proof by induction, are introduced in stages throughout the text. Mancosu, Galvan, and Zach's introduction will provide a solid foundation for those looking to understand this central area of mathematical logic and the philosophy of mathematics.

Focusing on Gentzen-type proof theory, this volume presents a detailed overview of creative works by author Gaisi Takeuti and other twentieth-century logicians. The text explores applications of proof theory to logic as well as other areas of mathematics. Suitable for advanced undergraduates and graduate students of mathematics, this long-out-of-print monograph forms a cornerstone for any library in mathematical logic and related topics.
The three-part treatment begins with an exploration of first order systems, including a treatment of predicate calculus involving Gentzen's cut-elimination theorem and the theory of natural numbers in terms of Gödel's incompleteness theorem and Gentzen's consistency proof. The second part, which considers second order and finite order systems, covers simple type theory and infinitary logic. The final chapters address consistency problems with an examination of consistency proofs and their applications.

This introduction to the basic ideas of structural proof theory contains a thorough discussion and comparison of various types of formalization of first-order logic. Examples are given of several areas of application, namely: the metamathematics of pure first-order logic (intuitionistic as well as classical); the theory of logic programming; category theory; modal logic; linear logic; first-order arithmetic and second-order logic. In each case the aim is to illustrate the methods in relatively simple situations and then apply them elsewhere in much more complex settings. There are numerous exercises throughout the text. In general, the only prerequisite is a standard course in first-order logic, making the book ideal for graduate students and beginning researchers in mathematical logic, theoretical computer science and artificial intelligence. For the new edition, many sections have been rewritten to improve clarity, new sections have been added on cut elimination, and solutions to selected exercises have been included.