Date and Time
Normal view MARC view ISBD view

A course in mathematical logic

by Manin, Yu. I.
Material type: materialTypeLabelBookSeries: Graduate texts in mathematics53. Publisher: New York : Springer-Verlag, 1977Description: xiii, 286 p.ISBN: 9780387902432.Subject(s): Logic. -- Symbolic and mathematical | Mathematics | Mathematical logic and foundationsDDC classification: 511.3 M314C Online resources: Full text available from SpringerLink ebooks - Mathematics and Statistics (Archive)
Contents:
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 -- VI Diophantine sets and algorithmic undecidability -- III Provability and Computability -- VII Gödel's incompleteness theorem -- VIII Recursive groups.
In: Springer eBooksSummary: 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.
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Current location Call number Copy number Status Date due Barcode
Books Books Central Library, IISER Bhopal

 

OPAC URL: http://webopac.iiserb.ac.in/

511.3 M314C (Browse shelf) 1 Available 0358

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 -- VI Diophantine sets and algorithmic undecidability -- III Provability and Computability -- VII Gödel's incompleteness theorem -- VIII Recursive groups.

License restrictions may limit access.

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.

There are no comments for this item.

Log in to your account to post a comment.



Contact for Queries: skpathak@iiserb.ac.in

Powered by Koha