Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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, Henkin's proof of the completeness theorem has been postponed until the reader has gained more experience in proof techniques. The exposition of the proof itself has been improved by breaking it down into smaller pieces and using the notion of a scapegoat theory. There is also an entirely new section on semantic trees.
Similar content being viewed by others
Table of contents (6 chapters)
Authors and Affiliations
Accessibility Information
PDF accessibility summary
This PDF is not accessible. It is based on scanned pages and does not support features such as screen reader compatibility or described non-text content (images, graphs etc). However, it likely supports searchable and selectable text based on OCR (Optical Character Recognition). Users with accessibility needs may not be able to use this content effectively. Please contact us at accessibilitysupport@springernature.com if you require assistance or an alternative format.
Bibliographic Information
Book Title: Introduction to Mathematical Logic
Authors: Elliott Mendelson
Series Title: The Wadsworth & Brooks/Cole Mathematics Series
DOI: https://doi.org/10.1007/978-1-4615-7288-6
Publisher: Springer New York, NY
-
eBook Packages: Springer Book Archive
Copyright Information: Wadsworth, Inc., Belmont, California 1987
Softcover ISBN: 978-1-4615-7290-9Published: 13 April 2012
eBook ISBN: 978-1-4615-7288-6Published: 06 December 2012
Edition Number: 1
Number of Pages: X, 342
Topics: Science, Humanities and Social Sciences, multidisciplinary