//]]>
Item type | Location | Call Number | Status | Date Due |
---|---|---|---|---|
Book | AUM Main Library | 511.3 M296 (Browse Shelf) | Available |
511.3 B687Many-valued logics / | 511.3 C456Mathematical logic / | 511.3 H396Diamond : | 511.3 M296A course in mathematical logic for mathematicians / | 511.3 M537Introduction to mathematical logic / | 511.3 R265A concise introduction to mathematical logic / |
The first edition was published in 1977 with the title: A course in mathematical logic.
Includes bibliographical references (p. [379]-380) and index.
Provability: I. Introduction to formal languages ; II. Truth and deducibility ; III. The continuum problem and forcing ; IV. The continuum problem and constructible sets -- Computability: V. Recursive functions and Church's thesis ; VI. Diophantine sets and algorithmic undecidability -- Provability and computability: VII. G�odel's incompleteness theorem ; VIII. Recursive groups ; IX. Constructive universe and computation -- Model theory: X. Model theory.
"A Course in Mathematical Logic for Mathematicians, Second Edition offers a straightforward introduction to modern mathematical logic that will appeal to the intuition of working mathematicians. The book begins with an elementary introduction to formal languages and proceeds to a discussion of proof theory. It then presents several highlights of 20th century mathematical logic, including theorems of Godel and Tarski, and Cohen's theorem on the independence of the continuum hypothesis. A unique feature of the text is a discussion of quantum logic." "The exposition then moves to a discussion of computability theory that is based on the notion of recursive functions and stresses number-theoretic connections. The text presents a complete proof of the theorem of Davis-Putnam-Robinson-Matiyasevich as well as a proof of Higman's theorem on recursive groups. Kolmogorov complexity is also treated."--BOOK JACKET.
There are no comments for this item.