Shortcuts
Please wait while page loads.
SISSA Library . Default .
PageMenu- Main Menu-
Page content

Catalogue Display

A Course in Mathematical Logic

A Course in Mathematical Logic
Catalogue Information
Field name Details
Dewey Class 511.3
Title A Course in Mathematical Logic ([EBook]) / by Yu. I. Manin.
Author Manin, Yuri Ivanovich
Other name(s) SpringerLink (Online service)
Publication New York, NY : Springer , 1977.
Physical Details XIII, 288 pages : online resource.
Series Graduate texts in mathematics 0072-5285 ; ; 53
ISBN 9781475743852
Summary Note 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.:
Contents note 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’s thesis -- VI Diophantine sets and algorithmic undecidability -- III Provability and Computability -- VII Gödel’s incompleteness theorem -- VIII Recursive groups.
System details note Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site http://dx.doi.org/10.1007/978-1-4757-4385-2
Links to Related Works
Subject References:
Authors:
See Also:
Corporate Authors:
Series:
Classification:
Catalogue Information 48670 Beginning of record . Catalogue Information 48670 Top of page .

Reviews


This item has not been rated.    Add a Review and/or Rating48670
Quick Search