114,95 €*
-17 % UVP 139,09 €
Versandkostenfrei per Post / DHL
Lieferzeit 1-2 Wochen
This introduction to mathematical logic starts with propositional calculus and first-order logic. Topics covered include syntax, semantics, soundness, completeness, independence, normal forms, vertical paths through negation normal formulas, compactness, Smullyan's Unifying Principle, natural deduction, cut-elimination, semantic tableaux, Skolemization, Herbrand's Theorem, unification, duality, interpolation, and definability.
The last three chapters of the book provide an introduction to type theory (higher-order logic). It is shown how various mathematical concepts can be formalized in this very expressive formal language. This expressive notation facilitates proofs of the classical incompleteness and undecidability theorems which are very elegant and easy to understand. The discussion of semantics makes clear the important distinction between standard and nonstandard models which is so important in understanding puzzling phenomena such as the incompleteness theorems and Skolem's Paradox about countable models of set theory.
Some of the numerous exercises require giving formal proofs. A computer program called ETPS which is available from the web facilitates doing and checking such exercises.
Audience: This volume will be of interest to mathematicians, computer scientists, and philosophers in universities, as well as to computer scientists in industry who wish to use higher-order logic for hardware and software specification and verification.
This introduction to mathematical logic starts with propositional calculus and first-order logic. Topics covered include syntax, semantics, soundness, completeness, independence, normal forms, vertical paths through negation normal formulas, compactness, Smullyan's Unifying Principle, natural deduction, cut-elimination, semantic tableaux, Skolemization, Herbrand's Theorem, unification, duality, interpolation, and definability.
The last three chapters of the book provide an introduction to type theory (higher-order logic). It is shown how various mathematical concepts can be formalized in this very expressive formal language. This expressive notation facilitates proofs of the classical incompleteness and undecidability theorems which are very elegant and easy to understand. The discussion of semantics makes clear the important distinction between standard and nonstandard models which is so important in understanding puzzling phenomena such as the incompleteness theorems and Skolem's Paradox about countable models of set theory.
Some of the numerous exercises require giving formal proofs. A computer program called ETPS which is available from the web facilitates doing and checking such exercises.
Audience: This volume will be of interest to mathematicians, computer scientists, and philosophers in universities, as well as to computer scientists in industry who wish to use higher-order logic for hardware and software specification and verification.
Facilitates proofs of the classical incompleteness and undecidability theorems which are very elegant and easy to understand
The discussion of semantics makes clear the important distinction between standard and nonstandard models which is so important in understanding puzzling phenomena such as the incompleteness theorems and Skolem's Paradox about countable models of set theory
Includes supplementary material: [...]
| Erscheinungsjahr: | 2002 |
|---|---|
| Fachbereich: | Grundlagen |
| Genre: | Importe, Mathematik |
| Rubrik: | Naturwissenschaften & Technik |
| Medium: | Buch |
| Inhalt: |
xviii
390 S. |
| ISBN-13: | 9781402007637 |
| ISBN-10: | 1402007639 |
| Sprache: | Englisch |
| Einband: | Gebunden |
| Autor: | Andrews, Peter B. |
| Auflage: | Second Edition 2002 |
| Hersteller: |
Springer Netherland
Springer Netherlands |
| Verantwortliche Person für die EU: | Springer Verlag GmbH, Tiergartenstr. 17, D-69121 Heidelberg, juergen.hartmann@springer.com |
| Maße: | 246 x 165 x 28 mm |
| Von/Mit: | Peter B. Andrews |
| Erscheinungsdatum: | 31.07.2002 |
| Gewicht: | 0,823 kg |
Facilitates proofs of the classical incompleteness and undecidability theorems which are very elegant and easy to understand
The discussion of semantics makes clear the important distinction between standard and nonstandard models which is so important in understanding puzzling phenomena such as the incompleteness theorems and Skolem's Paradox about countable models of set theory
Includes supplementary material: [...]
| Erscheinungsjahr: | 2002 |
|---|---|
| Fachbereich: | Grundlagen |
| Genre: | Importe, Mathematik |
| Rubrik: | Naturwissenschaften & Technik |
| Medium: | Buch |
| Inhalt: |
xviii
390 S. |
| ISBN-13: | 9781402007637 |
| ISBN-10: | 1402007639 |
| Sprache: | Englisch |
| Einband: | Gebunden |
| Autor: | Andrews, Peter B. |
| Auflage: | Second Edition 2002 |
| Hersteller: |
Springer Netherland
Springer Netherlands |
| Verantwortliche Person für die EU: | Springer Verlag GmbH, Tiergartenstr. 17, D-69121 Heidelberg, juergen.hartmann@springer.com |
| Maße: | 246 x 165 x 28 mm |
| Von/Mit: | Peter B. Andrews |
| Erscheinungsdatum: | 31.07.2002 |
| Gewicht: | 0,823 kg |
Ähnliche Produkte
Lieferzeit 1-2 Wochen
Lieferzeit 1-2 Werktage
Lieferzeit 1-2 Wochen
Lieferzeit 1-2 Werktage
Lieferzeit 2-4 Werktage
Lieferzeit 1-2 Wochen
Lieferzeit 1-2 Werktage
Lieferzeit 1-2 Werktage
Lieferzeit 1-2 Werktage
Lieferzeit 4-7 Werktage