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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Heinz-Dieter Ebbinghaus is Professor Emeritus at the Mathematical Institute of the University of Freiburg. His work spans fields in logic, such as model theory and set theory, and includes historical aspects.
Jörg Flum is Professor Emeritus at the Mathematical Institute of the University of Freiburg. His research interests include mathematical logic, finite model theory, and parameterized complexity theory.
Wolfgang Thomas is Professor Emeritus at the Computer Science Department of RWTH Aachen University. His research interests focus on logic in computer science, in particular logical aspects of automata theory.Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : World of Books (was SecondSale), Montgomery, IL, Etats-Unis
Etat : Good. Item in good condition and has highlighting/writing on text. Used texts may not contain supplemental items such as CDs, info-trac etc. N° de réf. du vendeur 00098743279
Quantité disponible : 1 disponible(s)
Vendeur : Romtrade Corp., STERLING HEIGHTS, MI, Etats-Unis
Etat : New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. N° de réf. du vendeur ABBB-40212
Quantité disponible : 1 disponible(s)
Vendeur : Basi6 International, Irving, TX, Etats-Unis
Etat : Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. N° de réf. du vendeur ABEOCT25-234200
Quantité disponible : 3 disponible(s)
Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Etat : new. Questo è un articolo print on demand. N° de réf. du vendeur STI8XGGJOH
Quantité disponible : Plus de 20 disponibles
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. N° de réf. du vendeur 26384672407
Quantité disponible : 1 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. N° de réf. du vendeur 379198792
Quantité disponible : 1 disponible(s)
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. N° de réf. du vendeur 18384672413
Quantité disponible : 1 disponible(s)
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This textbook introduces first-order logic and its role in the foundations of mathematics by examining fundamental questions. What is a mathematical proof How can mathematical proofs be justified Are there limitations to provability To what extent can machines carry out mathematical proofs In answering these questions, this textbook explores the capabilities and limitations of algorithms and proof methods in mathematics and computer science.The chapters are carefully organized, featuring complete proofs and numerous examples throughout. Beginning with motivating examples, the book goes on to present the syntax and semantics of first-order logic. After providing a sequent calculus for this logic, a Henkin-type proof of the completeness theorem is given. These introductory chapters prepare the reader for the advanced topics that follow, such as Gödel's Incompleteness Theorems, Trakhtenbrot's undecidability theorem, Lindström's theorems on the maximality of first-order logic, and results linking logic with automata theory. This new edition features many modernizations, as well as two additional important results: The decidability of Presburger arithmetic, and the decidability of the weak monadic theory of the successor function.Mathematical Logic is ideal for students beginning their studies in logic and the foundations of mathematics. Although the primary audience for this textbook will be graduate students or advanced undergraduates in mathematics or computer science, in fact the book has few formal prerequisites. It demands of the reader only mathematical maturity and experience with basic abstract structures, such as those encountered in discrete mathematics or algebra. 316 pp. Englisch. N° de réf. du vendeur 9783030738389
Quantité disponible : 2 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Explores additional important decidability results in this thoroughly updated new editionIntroduces mathematical logic by analyzing foundational questions on proofs and provability in mathematicsHighlights the capabilities and limitations o. N° de réf. du vendeur 458553932
Quantité disponible : Plus de 20 disponibles
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Buch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -This textbook introduces first-order logic and its role in the foundations of mathematics by examining fundamental questions. What is a mathematical proof How can mathematical proofs be justified Are there limitations to provability To what extent can machines carry out mathematical proofs In answering these questions, this textbook explores the capabilities and limitations of algorithms and proof methods in mathematics and computer science.The chapters are carefully organized, featuring complete proofs and numerous examples throughout. Beginning with motivating examples, the book goes on to present the syntax and semantics of first-order logic. After providing a sequent calculus for this logic, a Henkin-type proof of the completeness theorem is given. These introductory chapters prepare the reader for the advanced topics that follow, such as Gödel's Incompleteness Theorems, Trakhtenbrot's undecidability theorem, Lindström's theorems on the maximality of first-order logic, and results linking logic with automata theory. This new edition features many modernizations, as well as two additional important results: The decidability of Presburger arithmetic, and the decidability of the weak monadic theory of the successor function.Mathematical Logic is ideal for students beginning their studies in logic and the foundations of mathematics. Although the primary audience for this textbook will be graduate students or advanced undergraduates in mathematics or computer science, in fact the book has few formal prerequisites. It demands of the reader only mathematical maturity and experience with basic abstract structures, such as those encountered in discrete mathematics or algebra.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 316 pp. Englisch. N° de réf. du vendeur 9783030738389
Quantité disponible : 1 disponible(s)