mathematical logic von ebbinghaus (31 Ergebnisse)

Zustand: Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.

Hardcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 03 EBB 2nd.Ed 9783540942580 Sprache: Englisch Gewicht in Gramm: 550.

Zustand: 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.

Zustand: New. pp. 313.

Zustand: 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.

Hardcover. Zustand: Fine. 2nd Edition.

Zustand: 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.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Zustand: New.

Zustand: New. In English.

Zustand: New. In.

Zustand: New. In English.

Zustand: New. In.

Zustand: Good. Original boards, illustrated with numerous equations, 8vo. Undergraduate Texts in Mathematics.; Name in pen on title page.

Zustand: New. 2022. Paperback. . . . . . Books ship from the US and Ireland.

Hardcover. Zustand: Fine. 1st Edition. Second printing. Hardcover volume, measuring approximately 6.5" x 9.75", is bound in glossy yellow paper spine and boards. Book shows very light shelfwear. Binding is firm. Stamp of the Department of Mathematics, Cornell University appears on front and rear flyleaves. Interior is otherwise clean and bright. ix/216 pages. "A self-contained introduction to first-order logic includes an exposition of topics not usually found in introductory texts (such as Trachtenbrot's undecidability theorem, Fraisse's characterization of elementary equivalence, and Lindstrom's theorem on the maximality of first-order logic).".

Zustand: NEW.

Zustand: New. Editor(s): Ebbinghaus, Heinz-Dieter. Series: Perspectives in Mathematical Logic. Num Pages: 617 pages, 1 black & white illustrations, biography. BIC Classification: PBCD. Category: (P) Professional & Vocational. Dimension: 280 x 210 x 33. Weight in Grams: 1612. . 2013. Softcover reprint of the original 1st ed. 1987. Paperback. . . . . Books ship from the US and Ireland.

Taschenbuch. Zustand: Neu. 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 GmbH, Tiergartenstr. 17, 69121 Heidelberg 316 pp. Englisch.

Zustand: New. 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.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Paperback. Zustand: Brand New. 664 pages. 11.10x8.30x1.40 inches. In Stock.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Gert H. Müller The growth of the number of publications in almost all scientific areas, as in the area of (mathematical) logic, is taken as a sign of our scientifically minded culture, but it also has a terrifying aspect. In addition, given the rapidly growing sophistica tion, specialization and hence subdivision of logic, researchers, students and teachers may have a hard time getting an overview of the existing literature, partic ularly if they do not have an extensive library available in their neighbourhood: they simply do not even know what to ask for! More specifically, if someone vaguely knows that something vaguely connected with his interests exists some where in the literature, he may not be able to find it even by searching through the publications scattered in the review journals. Answering this challenge was and is the central motivation for compiling this Bibliography. The Bibliography comprises (presently) the following six volumes (listed with the corresponding Editors): I. Classical Logic W. Rautenberg 11. Non-classical Logics W. Rautenberg 111. Model Theory H. -D. Ebbinghaus IV. Recursion Theory P. G. Hinman V. Set Theory A. R. Blass VI. ProofTheory; Constructive Mathematics J. E. Kister; D. van Dalen & A. S. Troelstra.

Buch. Zustand: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 308 pp. Englisch.

Buch. Zustand: Neu. 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 GmbH, Tiergartenstr. 17, 69121 Heidelberg 316 pp. Englisch.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Paperback. Zustand: Brand New. 2nd reprint edition. 301 pages. French language. 9.25x6.10x0.79 inches. In Stock.

Org.-Hardcover. Quart, XLV, 617 S., einwandfreies, frisches Exemplar. [=Omega-Bibliography of Mathematical Logic. Edited by Gert H. Müller in Collaboration with Wolfgang Lenski. Vol. III] - ENGLISH: In-quarto, xlv, 617 pp., clean, fresh copy. ISBN 3-540-15522-8 UND 0-387-15522-8. [=Omega-Bibliography of Mathematical Logic. Edited by Gert H. Müller in Collaboration with Wolfgang Lenski. Vol. III] - ENGLISH: In-quarto, xlv, 617 pp., clean, fresh copy. ISBN 3-540-15522-8 UND 0-387-15522-8. 3000 g.