No label defined (Q4485829)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1461245
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1461245

      Statements

      19 June 2000
      0 references
      propositional logic
      0 references
      first-order logic
      0 references
      term rewriting
      0 references
      textbook
      0 references
      resolution
      0 references
      0 references
      The present work is intended as a textbook for an undergraduate course on logic for students in either mathematics or computer science. The topics covered are historical background, propositional logic, equational logic, first-order logic, resolution, and term rewriting. The book is well written; the amounts of detail and of examples provided are unusually large. While this will no doubt ease self-teaching and course design based on the book it invariably entails that despite its considerable size the range of topics covered remains modest. Moreover, the topics that are covered are somewhat biased towards applications in fully automatic theorem proving such as William McCune's Otter System. Central results like Gödel's incompleteness theorem or Gentzen's cut elimination are excluded. On the side of applications in computer science we miss interactive theorem proving as well as temporal and modal logics both of which are of central importance in practical program verification. An interesting and unusual feature is the comprehensive discussion of the historical foundations of the subject including for instance the 24 syllogisms of Aristotelian logic and Boole's algebraic approach. Seeing these early attempts at formalising logical reasoning underscores how big an intellectual achievement the current formulation of first-order logic actually is. In summary, the book can be recommended for a course if the lecturer complements the syllabus with some external material or if the main focus is to provide necessary background for understanding the workings of an automatic theorem prover based on resolution and rewriting like Otter. The expert reader will find some scattered gems in the examples and historical remarks like Wilkie's incompleteness result of Tarski's high school arithmetic, Tseitin and Haken's lower bounds for resolution proofs, Robbins' axiomatisation of Boolean algebra; most, however, without proofs.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references