Author | Manin, Yu. I. author |
---|---|

Title | A Course in Mathematical Logic [electronic resource] / by Yu. I. Manin |

Imprint | New York, NY : Springer New York : Imprint: Springer, 1977 |

Connect to | http://dx.doi.org/10.1007/978-1-4757-4385-2 |

Descript | XIII, 288 p. online resource |

SUMMARY

1. This book is above all addressed to mathematicians. It is intended to be a textbook of mathematical logic on a sophisticated level, presenting the reader with several of the most significant discoveries of the last ten or fifteen years. These include: the independence of the continuum hypotheยญ sis, the Diophantine nature of enumerable sets, the impossibility of finding an algorithmic solution for one or two old problems. All the necessary preliminary material, including predicate logic and the fundamentals of recursive function theory, is presented systematically and with complete proofs. We only assume that the reader is familiar with "naive" set theoretic arguments. In this book mathematical logic is presented both as a part of matheยญ matics and as the result of its self-perception. Thus, the substance of the book consists of difficult proofs of subtle theorems, and the spirit of the book consists of attempts to explain what these theorems say about the mathematical way of thought. Foundational problems are for the most part passed over in silence. Most likely, logic is capable of justifying mathematics to no greater extent than biology is capable of justifying life. 2. The first two chapters are devoted to predicate logic. The presentaยญ tion here is fairly standard, except that semantics occupies a very domiยญ nant position, truth is introduced before deducibility, and models of speech in formal languages precede the systematic study of syntax

CONTENT

I Provability -- I Introduction to formal languages -- II Truth and deducibility -- III The continuum problem and forcing -- IV The continuum problem and constructible sets -- II Computability -- V Recursive functions and Churchโ{128}{153}s thesis -- VI Diophantine sets and algorithmic undecidability -- III Provability and Computability -- VII Gรถdelโ{128}{153}s incompleteness theorem -- VIII Recursive groups

Mathematics
Mathematical logic
Mathematics
Mathematical Logic and Foundations