| 000 | 02325cam a22003017a 4500 | ||
|---|---|---|---|
| 005 | 20240312151945.0 | ||
| 008 | 090810s2010 nyua b 001 0 eng d | ||
| 020 | _a1441906142 | ||
| 020 | _a9781441906144 | ||
| 020 | _a9781441906151 | ||
| 020 | _a1441906150 | ||
| 041 | 1 | _aeng | |
| 082 | 0 | 4 |
_a511.3 _bManC2 |
| 100 | 1 | _aManin, Yu. I. | |
| 245 | 1 | 2 |
_aA Course in Mathematical Logic for Mathematicians / _cYu. I. Manin |
| 250 | _a2nd Ed. | ||
| 260 |
_aNew York : _bSpringer, _cc2010. |
||
| 300 | _axvii, 384p. | ||
| 490 | 1 | _aGraduate Texts in Mathematics | |
| 500 | _aThe first edition was published in 1977 with the title: A Course in Mathematical Logic. | ||
| 500 | _aChapters I-VIII were translated from Russian by Neal Koblitz; With new chapters by Boris Zilber and Yuri I. Manin. | ||
| 505 | 0 | _aProvability: 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. | |
| 520 | 1 | _a"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. | |
| 650 | 0 | _aLogic, Symbolic and Mathematical | |
| 700 | 1 | _aKoblitz, Neal | |
| 700 | 1 | _aZilber, Boris | |
| 942 | _cBK | ||
| 999 |
_c5532 _d5532 |
||