A concise introduction to mathematical logic
Author(s)
Bibliographic Information
A concise introduction to mathematical logic
(Universitext)
Springer, c2010
3rd ed
- : pbk
Available at 21 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Bibliography: p. 299-306
Includes indexes
Description and Table of Contents
Description
by Lev Beklemishev, Moscow The ?eld of mathematical logic-evolving around the notions of logical validity, provability, and computation-was created in the ?rst half of the previous century by a cohort of brilliant mathematicians and philosophers such as Frege, Hilbert, Godel, Turing, Tarski, Malcev, Gentzen, and some others. The development of this discipline is arguably among the highest achievements of science in the twentieth century: it expanded mat- matics into a novel area of applications, subjected logical reasoning and computability to rigorous analysis, and eventually led to the creation of computers. The textbook by Professor Wolfgang Rautenberg is a well-written - troduction to this beautiful and coherent subject. It contains classical material such as logical calculi, beginnings of model theory, and Godel's incompleteness theorems, as well as some topics motivated by appli- tions, such as a chapter on logic programming. The author has taken great care to make the exposition readable and concise; each section is accompanied by a good selection of exercises.
A special word of praise is due for the author's presentation of Godel's second incompleteness theorem, in which the author has succeeded in giving an accurate and simple proof of the derivability conditions and the provable ? -completeness, a technically di?cult point that is usually 1 omittedintextbooksofcomparablelevel. Thisworkcanberecommended to all students who want to learn the foundations of mathematical logic.
Table of Contents
Propositional Logic.- First-Order Logic.- Complete logical Calculi.- Foundations of Logic Programming.- Elements of Model Theory.- Incompleteness and Undecidability.- On the Theory of Self-Reference.
by "Nielsen BookData"