Mathematical Logic (Undergraduate Texts in Mathematics) de H.-D. Ebbinghaus

Mathematical Logic: Undergraduate Texts in Mathematics

H.-D. Ebbinghaus

J. Flum

Wolfgang Thomas

en Limba Engleză Paperback – 11 dec 2012

This introduction to first-order logic clearly works out the role of first-order logic in the foundations of mathematics, particularly the two basic questions of the range of the axiomatic method and of theorem-proving by machines. It covers several advanced topics not commonly treated in introductory texts, such as Fraïssé's characterization of elementary equivalence, Lindström's theorem on the maximality of first-order logic, and the fundamentals of logic programming.

Citește tot Restrânge

Toate formatele și edițiile

	Preț	Express
Paperback (1)	425^.52 lei 38-44 zile
Springer – 11 dec 2012	425^.52 lei 38-44 zile
Hardback (1)	384^.89 lei 3-5 săpt.	+25^.70 lei 10-14 zile
Springer – 10 iun 1994	384^.89 lei 3-5 săpt.	+25^.70 lei 10-14 zile

Din seria Undergraduate Texts in Mathematics

17%

Preț: 362^.13 lei
17%

Preț: 365^.42 lei
20%

Preț: 466^.83 lei
Preț: 400^.42 lei
Preț: 298^.00 lei
Preț: 364^.40 lei
8%

Preț: 384^.89 lei
Preț: 257^.71 lei
17%

Preț: 395^.93 lei
Preț: 380^.26 lei
Preț: 339^.36 lei
Preț: 372^.26 lei
Preț: 370^.77 lei
Preț: 440^.01 lei
Preț: 402^.33 lei
17%

Preț: 366^.38 lei
Preț: 433^.85 lei
Preț: 290^.80 lei
19%

Preț: 368^.78 lei
Preț: 400^.42 lei
19%

Preț: 400^.52 lei
Preț: 359^.48 lei
Preț: 415^.94 lei
17%

Preț: 373^.59 lei
Preț: 407^.62 lei
Preț: 407^.96 lei
Preț: 358^.10 lei
Preț: 280^.65 lei
17%

Preț: 368^.60 lei
17%

Preț: 367^.24 lei
Preț: 395^.09 lei
Preț: 424^.14 lei
Preț: 304^.91 lei
13%

Preț: 389^.61 lei
17%

Preț: 362^.67 lei
15%

Preț: 417^.73 lei
Preț: 332^.02 lei
Preț: 329^.94 lei
19%

Preț: 492^.82 lei
Preț: 396^.24 lei
Preț: 390^.08 lei
15%

Preț: 521^.04 lei
Preț: 402^.00 lei
15%

Preț: 531^.72 lei
15%

Preț: 447^.81 lei

Descriere

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.

Cuprins

Preface; Part A: 1. Introduction; 2. Syntax of First-Order Languages; 3. Semantics of first-Order Languages; 4. A Sequent Calculus; 5. The Completeness Theorem; 6. The Lowenheim-Skolem and the Compactness Theorem; 7. The Scope of First-Order Logic; 8. Syntactic Interpretations and Normal Forms; Part B: 9. Extensions of First-Order Logic; 10. Limitations of the Formal Method; 11. Free Models and Logic Programming; 12. An Algebraic Characterization of Elementary Equivalence; 13. Lindstroem's Theorems; References; Symbol Index; Subject Index