Introduction to Mathematical Logic and Type Theory. to Truth through Proof

Peter B. Andrews

ISBN 10: 0120585367 / ISBN 13: 9780120585366

Verlag: Academic Pr, 1986

Beschreibung

Computer Science & Applied Mathematics; Foxing to exterior edge of pages. - Good overall condition. General wear. No major blemishes. No writing. ; - We're committed to your satisfaction. We offer free returns and respond promptly to all inquiries. Your item will be carefully wrapped in bubble wrap and securely boxed. All orders ship on the same or next business day. Buy with confidence.

Bestandsnummer des Verkäufers HVD-26075-A-0

Bibliografische Details

• Titel: Introduction to Mathematical Logic and Type Theory. to Truth through Proof
• Verlag: Academic Pr
• Erscheinungsjahr: 1986
• Sprache: Englisch
• ISBN-10: 0120585367
• ISBN-13: 9780120585366
• Einband: Paperback
• Zustand: Good

Über diesen Titel

Inhaltsangabe

Book by Andrews Peter B

Reseña del editor

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.