Introduction to Mathematical Logic, Third Edition von Elliott Mendelson: new Hardcover (1987)

Beschreibung

Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks.

Bestandsnummer des Verk�ufers Scanned0534066240

Verk�ufer kontaktieren

Diesen Artikel melden

Bibliografische Details

Titel: Introduction to Mathematical Logic, Third Edition
Verlag: Springer
Erscheinungsjahr: 1987
Sprache: Englisch
ISBN-10: 0534066240
ISBN-13: 9780534066246
Einband: Hardcover
Auflage: 3. Auflage
Zustand: new

�ber diesen Titel

Inhaltsangabe

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.

Rese�a del editor

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.

��ber diesen Titel� kann sich auf eine andere Ausgabe dieses Titels beziehen.