A Course in Mathematical Logic: v. 53 - Rilegato

Manin, Y. I.

Rilegato

ISBN 10: 0387902430 ISBN 13: 9780387902432

Casa editrice: Springer Verlag, 1977

Riassunto

This book is a text of mathematical logic on a sophisticated level, presenting 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 formulas as axioms and Highman's theorem on groups defined by enumerable sets of generators and relations. A number of informal digressions concerned with psychology, linguistics, and common sense logic should interest students of the philosophy of science or the humanities.

Su questo libro

Recensione

"As one might expect from a graduate text on logic by a very distinguished algebraic geometer, this book assumes no previous acquaintance with logic, but proceeds at a high level of mathematical sophistication. Chapters I and II form a short course. Chapter I is a very informal introduction to formal languages, e.g., those of first order Peano arithmetic and of ZFC set theory. Chapter II contains Tarski's definition of truth, Gödel's completeness theorem, and the Löwenheim-Skolem theorem. The emphasis is on semantics rather than syntax. Some rarely-covered side topics are included (unique readability for languages with parentheses, Mostowski's transitive collapse lemma, formalities of introducing definable constants and function symbols). Some standard topics are neglected. (The compactness theorem is not mentioned!) The latter part of Chapter II contains Smullyan's quick proof of Tarski's theorem on the undefinability of truth in formal arithmetic, and an account of the Kochen-Specker "no hidden variables" theorem in quantum logic. There are digressions on philosophical issues (formal logic vs. ordinary language, computer proofs). A wealth of material is introduced in these first 100 pages of the book..."--MATHEMATICAL REVIEWS

Contenuti

Contents: 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: Gödel's Incompleteness Theorem. Recursive Groups.- Index.

Dettagli dell?edizione

• Editore: Springer Verlag
• Data di pubblicazione: 1977
• ISBN 10: 0387902430
• ISBN 13: 9780387902432
• Rilegatura: Copertina rigida
• Lingua: Inglese
• Numero di pagine: 299