Noted for its integration of real-world data and case studies, this guide offers sound coverage of the theoretical aspects of mathematical statistics. It demonstrates how and when to use statistical methods, while reinforcing the calculus that readers have already mastered. Presents standard statistical techniques in a mathematical context, allowing the reader to see the underlying hypotheses for the applications. Uses case studies and practical worked-out examples to motivate statistical reasoning and demonstrate the application of statistical methods to a wide variety of real-world situations. Discusses practical problems in the application of the ideas covered in each chapter, as well as common misunderstandings or faulty approaches. Revised Minitab sections now conform to the Version 14, the latest release. For anyone interested in learning more about mathematical statistics.

有：特征值、特征向量和相似性、酉相似、Schur三角化及其推论、正规矩阵、标准形和包括Jordan标准形在内的各种分解、LU分解、QR分解和酉矩阵、Hermite矩阵和复对称矩阵、向量范数和矩阵范数、特征值的估计和扰动、正定矩阵、非负矩阵。 《矩阵分析.卷1(英文版)(本科)》可作为理工科专业研究生或数学专业高年级本科生教材，也可供数学工作者和科技人员参考。

《同伦方法纵横谈》的大部分内容，就是在中学数学的基础上，从最浅显最富启发的例子入手，一环扣一环，介绍不动点算法、同伦算法及其计算复杂性理论的主要进展。除了科学内容本身之外，我们还着重发掘科学研究方法论的丰富内涵。将来真正进入这些研究领域的读者终究不会很多，但是科学故事和科研方法的启迪，将使绝大多数读者终身受益。

阿达玛在《数学科学文化理念传播丛书·数学领域中的发明心理学》中追随庞加莱在巴黎心理学学会上的著名讲演的思想，着重论述了以“无意识思维”为核心的数学发明心理过程，给人以强烈印象。

本书是一本经典的数理经济学教科书，自首次出版以来已获得国内外使用者的广泛认可。本书涵盖以下主要内容：静态（均衡）分析、比较静态分析、最优化问题、动态分析，结合数学方法在经济学中的应用，由浅入深、循序渐进地阐述了矩阵代数、导数与微分、积分学、微分方程与差分方程、最优控制理论等经济学中使用的主要数学方法。全书省略了过于艰深的数学证明，而将重点放在数学方法的经济应用上，书中穿插了大量的例题与习题，从而适用于致力于学习基本数学方法的经济学专业的学生，也适于学生自学。 在保持以前版本的主要目的、风格、结构的基础上，本版（第4版）主要做了以下改进：一是将数学规划问题放在第13章（“最优化问题”部分的最后一章），定名为“最优化问题的其他主题”；二是新增了关于最优控制理论的内容（第20章）；另外，对部分习题也进行了重新编排，使其在帮助巩固所学知识的同时，更能激发学生的自信，给予学生更好表现能力的机会。

《经济理论中的最优化方法》(第2版)为了全面地、系统地反映当代经济学的全貌及其进程，总结与挖掘当代经济学已有的和潜在的成果，展示当代经济学新的发展方向，特此编写了《当代经济学系列丛书》，《经济理论中的最优化方法》(第2版)是其中之一。

Determined to understand the repeating patterns he was finding in nature, French mathematician Benoit Mandelbrot used an early form of computer imagery to produce his own versions, coining the recurring shapes fractals. This installment of the PBS series "Nova" examines the rules of these self-similar patterns and explores the ways these fascinating geometric configurations can be applied in the fields of science, medicine and the arts.

爱多士是二十世纪最伟大的数学家之一，无疑也是最古怪独特的一位。他从小就有神童之称，为数学而生，为数学而死，为数学一生奔走，飘泊天涯。他那奇特的大脑始终是敞开的，装满了数学命题、定理、猜想与证明。 布鲁斯·谢克特以爱多士关注的世界著名难题与数学史上的许多轶闻趣事为线索，《我的大脑敞开了(爱多士的数学之旅)(精)》讲述了爱多士的传奇一生。阅读此书，令人重新记起对数学这门学问最原初的热情，重温大脑思考疑难问题时的兴奋心情，并在笑与泪中向往一生坚持理想与追求的美妙境界。

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.

《数学哲学》内容简介：只要将《数学哲学》第二版与第一版的目录随便比较一下，就可以发现它们之间既有重大差异，又有许多重复之处。总的说来，这一选本是由两种力量促成的。（1）第一版的使用者（以及第二版的可能使用者）的评论；（2）我们自己对这门学科在过去二十多年间的进展方向的认识。 我们感谢许多朋友和同事。他们指出了自己所认为的第一版中哪些内容有用，哪些内容不大有用，并指出他们觉得哪些内容可以加进书中。由于人数众多，恕不一一道谢。他们的意见非常宝贵，虽然选择内容的任务主要仍在我们身上。

《层论(第2版)(英文版)》主要讲述具有一般系数体系拓扑空间的上同调理论。层论包括对代数拓扑很重要的领域。书中有好多创新点，引进不少新概念，全书内容贯穿一致。证实了广义同调空间中层理论上同调满足同调基本特性的事实。将相对上同调引入层理论中。 读者有一定的基本同调代数和代数拓扑知识就可以理解《层论(第2版)(英文版)》。每章末都附有练习，这些可以帮助学生更好的理解书中的知识体系。附录给出了部分习题的解答。第二版中在内容上做了较大的改动，增加了80多例子和大量更深层次的内容，如，Cech上同调、Oliver变换、插值理论、广义流形、局部齐性空间、同调纤维和p进变换群。

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

《清华大学计算机系列教材:数理逻辑与集合论(第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)