scientific article; zbMATH DE number 1461245
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) History of mathematical logic and foundations (03-03) Classical propositional logic (03B05) Classical first-order logic (03B10) Mechanization of proofs and logical operations (03B35) Grammars and rewriting systems (68Q42)
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.
- Keeping logic in the trivium of computer science: a teaching perspective
- Replacement in logic
- Infinite Hamilton cycles in squares of locally finite graphs
- scientific article; zbMATH DE number 3115104 (Why is no real title available?)
- scientific article; zbMATH DE number 107624 (Why is no real title available?)
- Logics for Computer Science
- Paraconsistent constructive logic with strong negation as a contraction-free relevant logic
- scientific article; zbMATH DE number 1852932 (Why is no real title available?)
- Introduction to logic
- Logic calculi in informatics. How is logic used by the computer?
- Sets, logic and maths for computing
- Mathematical logic. Foundations for information science
- Subsumption-linear Q-resolution for QBF theorem proving
- Nominal logic with equations only
- Producing and verifying extremely large propositional refutations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4485829)