A Course in Mathematical Logic
Yurij I. Manin(Author)
Springer (Publisher)
197th Edition
Published in December 1977
Book
Hardback
XIII, 286 pages
978-3-540-90243-0 (ISBN)
Description
This text on mathematical logic presents the reader with several of the most significant discoveries of the last 10 to 15 years, including the independence of the continuum hypothesis, the Diophantine nature of enumerable sets and the impossibility of finding an algorithmic solution for certain problems. The book contains the first textbook presentation of Matijasevic's result. The central notions are provability and computability; the emphasis of the presentation is on aspects of the theory which are of interest to the working mathematician. Many of the approaches and topics covered are not standard parts of logic courses. They include a discussion of the logic of quantum mechanics, Goedel's constructible sets as a sub-class of von Neumann's universe, the Kolmogorov theory of complexity, Feferman's theorem on Goedel formulae as axioms and Highman's theorem on groups defined by enumerable sets of generators and relations.
More details
Series
Edition
197., 3rd printing
Language
English
Place of publication
Berlin
Germany
Target group
College/higher education
Dimensions
Height: 216 mm
Width: 138 mm
Weight
630 gr
ISBN-13
978-3-540-90243-0 (9783540902430)
Schweitzer Classification
Persons
Content
Provability - introduction to formal languages; truth and deducibility; the continuum problem and forcing; the continuum problem and constructible sets; computability - recursive functions and Church's thesis; diophantine sets and algorithmic undecidability; provability and computability; Goedel's incompleteness theorem; recursive groups.