An introduction to mathematical logic and type theory : to truth through proof

Bibliographic Information

An introduction to mathematical logic and type theory : to truth through proof

Peter B. Andrews

(Applied logic series, v. 27)

Kluwer Academic, c2002

2nd ed.

Available at  / 20 libraries

Search this Book/Journal

Note

Includes bibliographical references (p. 371-380) and index

Description and Table of Contents

Description

In case you are considering to adopt this book for courses with over 50 students, please contact ties.nijssen@springer.com for more information. 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.

Table of Contents

Preface to the Second Edition. Preface. Introduction. 1. Propositional Calculus. 2. First-Order Logic. 3. Provability and Refutability. 4. Further Topics in First-Order Logic. 5. Type Theory. 6. Formalized Number Theory. 7. Incompleteness and Undecidability. Supplementary Exercises. Summary of Theorems. Bibliography. List of Figures. Index.

by "Nielsen BookData"

Related Books: 1-1 of 1

Details

  • NCID
    BA58934443
  • ISBN
    • 1402007639
  • Country Code
    ne
  • Title Language Code
    eng
  • Text Language Code
    eng
  • Place of Publication
    Dordrecht ; Tokyo
  • Pages/Volumes
    xviii, 390 p.
  • Size
    25 cm
  • Parent Bibliography ID
Page Top