This careful, self-contained introduction to first-order logic includes an exposition of certain topics not usually found in introductory texts (such as Trachtenbrot's undecidability theorem, Fraisse's characterization of elementary equivalence, and Lindström's theorem on the maximality of first-order logic). The presentation is detailed and systematic without being long-winded or tedious. The role of first-order logic in the foundations of mathematics is worked out clearly, particularly the two basic questions of the range of the axiomatic method and of theorem-proving by machines. Many exercises accompany the text.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : World of Books (was SecondSale), Montgomery, IL, Etats-Unis
Paperback. Etat : Good. What is a mathematical proof? How can proofs be justified? Are there limitations to provability? To what extent can machines carry out mathe- matical proofs? Only in this century has there been success in obtaining substantial and satisfactory answers. The present book contains a systematic discussion of these results. The investigations are centered around first-order logic. Our first goal is Godel's completeness theorem, which shows that the con- sequence relation coincides with formal provability: By means of a calcu- lus consisting of simple formal inference rules, one can obtain all conse- quences of a given axiom system (and in particular, imitate all mathemat- ical proofs). A short digression into model theory will help us to analyze the expres- sive power of the first-order language, and it will turn out that there are certain deficiencies. For example, the first-order language does not allow the formulation of an adequate axiom system for arithmetic or analysis. On the other hand, this difficulty can be overcome--even in the framework of first-order logic-by developing mathematics in set-theoretic terms. We explain the prerequisites from set theory necessary for this purpose and then treat the subtle relation between logic and set theory in a thorough manner. N° de réf. du vendeur 00107787986
Quantité disponible : 1 disponible(s)
Vendeur : World of Books Inc, Montgomery, IL, Etats-Unis
Paperback. Etat : Good. What is a mathematical proof? How can proofs be justified? Are there limitations to provability? To what extent can machines carry out mathe- matical proofs? Only in this century has there been success in obtaining substantial and satisfactory answers. The present book contains a systematic discussion of these results. The investigations are centered around first-order logic. Our first goal is Godel's completeness theorem, which shows that the con- sequence relation coincides with formal provability: By means of a calcu- lus consisting of simple formal inference rules, one can obtain all conse- quences of a given axiom system (and in particular, imitate all mathemat- ical proofs). A short digression into model theory will help us to analyze the expres- sive power of the first-order language, and it will turn out that there are certain deficiencies. For example, the first-order language does not allow the formulation of an adequate axiom system for arithmetic or analysis. On the other hand, this difficulty can be overcome--even in the framework of first-order logic-by developing mathematics in set-theoretic terms. We explain the prerequisites from set theory necessary for this purpose and then treat the subtle relation between logic and set theory in a thorough manner. N° de réf. du vendeur CIN0387961704G
Quantité disponible : 1 disponible(s)
Vendeur : Mahler Books, PFLUGERVILLE, TX, Etats-Unis
Paperback. Etat : Very Good. This book is in very good condition; no remainder marks. It does have some cover shelfwear. Inside pages are clean. ; Undergraduate Texts In Mathematics; 225 pages. N° de réf. du vendeur 12GW21-490-313
Quantité disponible : 1 disponible(s)
Vendeur : Pella Books, Pella, IA, Etats-Unis
Trade Paperback. Etat : Used Very Good. N° de réf. du vendeur 236293
Quantité disponible : 1 disponible(s)