CMI Library

Your cart is empty.
Normal view MARC view ISBD view

A course in mathematical logic for mathematicians / Yu. I. Manin ; chapters I-VIII translated from the Russian by Neal Koblitz ; with new chapters by Boris Zilber and Yuri I. Manin.

By: Manin, I︠U︡. I.
Contributor(s): Koblitz, Neal, 1948- | Zilber, Boris.
Material type: TextTextSeries: Graduate texts in mathematics: 53.Publisher: New York : Springer, c2010Edition: 2nd ed.Description: xvii, 384 p. : E 29.99 ill. ; 25 cm.ISBN: 1441906142 (hbk.); 9781441906144 (hbk.); 9781441906151; 1441906150.Subject(s): Logic, Symbolic and mathematical | Einführung | Mathematische LogikDDC classification: 511.3 Other classification: 510 | SK 130
Contents:
Provability: I. Introduction to formal languages ; II. Truth and deducibility ; III. The continuum problem and forcing ; IV. The continuum problem and constructible sets -- Computability: V. Recursive functions and Church's thesis ; VI. Diophantine sets and algorithmic undecidability -- Provability and computability: VII. Gödel's incompleteness theorem ; VIII. Recursive groups ; IX. Constructive universe and computation -- Model theory: X. Model theory.
Review: "A Course in Mathematical Logic for Mathematicians, Second Edition offers a straightforward introduction to modern mathematical logic that will appeal to the intuition of working mathematicians. The book begins with an elementary introduction to formal languages and proceeds to a discussion of proof theory. It then presents several highlights of 20th century mathematical logic, including theorems of Godel and Tarski, and Cohen's theorem on the independence of the continuum hypothesis. A unique feature of the text is a discussion of quantum logic." "The exposition then moves to a discussion of computability theory that is based on the notion of recursive functions and stresses number-theoretic connections. The text presents a complete proof of the theorem of Davis-Putnam-Robinson-Matiyasevich as well as a proof of Higman's theorem on recursive groups. Kolmogorov complexity is also treated."--BOOK JACKET.
List(s) this item appears in: 2016-08-19
Item type Current location Call number Status Date due Barcode Item holds
Book Chennai Mathematical Institute
General Stacks 		511.3 MAN (Browse shelf) Available 9900
Total holds: 0

The first edition was published in 1977 with the title: A course in mathematical logic.

Includes bibliographical references (p. [379]-380) and index.

Provability: I. Introduction to formal languages ; II. Truth and deducibility ; III. The continuum problem and forcing ; IV. The continuum problem and constructible sets -- Computability: V. Recursive functions and Church's thesis ; VI. Diophantine sets and algorithmic undecidability -- Provability and computability: VII. Gödel's incompleteness theorem ; VIII. Recursive groups ; IX. Constructive universe and computation -- Model theory: X. Model theory.

"A Course in Mathematical Logic for Mathematicians, Second Edition offers a straightforward introduction to modern mathematical logic that will appeal to the intuition of working mathematicians. The book begins with an elementary introduction to formal languages and proceeds to a discussion of proof theory. It then presents several highlights of 20th century mathematical logic, including theorems of Godel and Tarski, and Cohen's theorem on the independence of the continuum hypothesis. A unique feature of the text is a discussion of quantum logic." "The exposition then moves to a discussion of computability theory that is based on the notion of recursive functions and stresses number-theoretic connections. The text presents a complete proof of the theorem of Davis-Putnam-Robinson-Matiyasevich as well as a proof of Higman's theorem on recursive groups. Kolmogorov complexity is also treated."--BOOK JACKET.