Introduction to Mathematical Logic

Mendelson, Elliott

ISBN 10: 0534066240 / ISBN 13: 9780534066246

Edité par Springer, 1987

Missing dust jacket; Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less 1.5. N° de réf. du vendeur G0534066240I3N01

Synopsis :

This classic in the field is a compact introduction to some of the basic topics of mathematical logic. Major changes in this edition include a new section on semantic trees; an expanded chapter on Axiomatic Set Theory; and full coverage of effective computability, where Turing computability is now the central notion and diagrams (flow-charts) are used to construct Turing machines. Recursion theory is covered in more detail, including the s-m-n theorem, the recursion theorem and Rice's Theorem. New sections on register machines and random access machines will be of special interest to computer science students. The proofs of the incompleteness theorems are now based on the Diagonalization Lemma and the text also covers Lob's Theorem and its connections with Godel's Second Theorem. This edition contains many new examples and the notation has been updated throughout. This book should be of interest to introductory courses for students of mathematics, philosophy, computer science and electrical engineering.

Présentation de l'éditeur: The Fourth Edition of this long-established text retains all the key features of the previous editions, covering the basic topics of a solid first course in mathematical logic. This edition includes an extensive appendix on second-order logic, a section on set theory with urlements, and a section on the logic that results when we allow models with empty domains. The text contains numerous exercises and an appendix furnishes answers to many of them.
Introduction to Mathematical Logic includes:

propositional logic

first-order logic

first-order number theory and the incompleteness and undecidability theorems of Gödel, Rosser, Church, and Tarski

axiomatic set theory

theory of computability
The study of mathematical logic, axiomatic set theory, and computability theory provides an understanding of the fundamental assumptions and proof techniques that form basis of mathematics. Logic and computability theory have also become indispensable tools in theoretical computer science, including artificial intelligence. Introduction to Mathematical Logic covers these topics in a clear, reader-friendly style that will be valued by anyone working in computer science as well as lecturers and researchers in mathematics, philosophy, and related fields.

Détails bibliographiques

Titre : Introduction to Mathematical Logic
Éditeur : Springer
Date d'édition : 1987
Reliure : Hardcover
Etat : Good
Etat de la jaquette : No Jacket
Edition : 3ème Édition