| 书目名称 | Introduction to Mathematical Logic | | 编辑 | Elliott Mendelson | | 视频video | | | 丛书名称 | The Wadsworth & Brooks/Cole Mathematics Series | | 图书封面 |  | | 描述 | This is a compact mtroduction to some of the pnncipal tOpICS of mathematical logic . In the belief that beginners should be exposed to the most natural and easiest proofs, I have used free-swinging set-theoretic methods. The significance of a demand for constructive proofs can be evaluated only after a certain amount of experience with mathematical logic has been obtained. If we are to be expelled from "Cantor‘s paradise" (as nonconstructive set theory was called by Hilbert), at least we should know what we are missing. The major changes in this new edition are the following. (1) In Chapter 5, Effective Computability, Turing-computabIlity IS now the central notion, and diagrams (flow-charts) are used to construct Turing machines. There are also treatments of Markov algorithms, Herbrand-Godel-computability, register machines, and random access machines. Recursion theory is gone into a little more deeply, including the s-m-n theorem, the recursion theorem, and Rice‘s Theorem. (2) The proofs of the Incompleteness Theorems are now based upon the Diagonalization Lemma. Lob‘s Theorem and its connection with Godel‘s Second Theorem are also studied. (3) In Chapter 2, Quantification Theory, | | 出版日期 | Book 1987 | | 关键词 | computability theory; mathematical logic; proof; set theory | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4615-7288-6 | | isbn_softcover | 978-1-4615-7290-9 | | isbn_ebook | 978-1-4615-7288-6 | | copyright | Wadsworth, Inc., Belmont, California 1987 |
The information of publication is updating
|
|
发表于 2025-3-21 16:35:33
