Mathematical logic for computer science.
binary decision diagramsclassical logiccomplexityGentzen systemsHilbert systemsHoare logiclogic programmingresolutionsemantic tableauxtemporal logic
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Mechanization of proofs and logical operations (03B35) Temporal logic (03B44) Logic in computer science (03B70) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Logic programming (68N17) Semantics in the theory of computing (68Q55) Logic in artificial intelligence (68T27)
The text of this second edition has been rewritten to a large extent. The overall structure, however, has only slightly been changed in comparison to the first edition (1992; Zbl 0808.68095). There are some minor variations in the material's distribution into chapters. Particularly, in the final parts of the book now the chapters on logic programming and on program verification preceed the chapters on temporal logic which, of course, now contain the applications of temporal logic (which had to be postponed in the first edition). Some material has been added. The most essential additions are sections on binary decision diagrams, on constraint logic programming, and on the completeness of the Hoare logic. The book, still, is an elementary introduction into logic with main emphasis upon computer science applications and upon algorithmic aspects. More advanced topics, which some chapters mention, are usually given without proofs, but with hints toward other sources that give the proofs. The book is well made as an introduction for computer scientists. It may even be a nice additional reading for mathematicians and logicians in undergraduate courses.
- scientific article; zbMATH DE number 578242
- scientific article; zbMATH DE number 53085
- scientific article; zbMATH DE number 595198
- Logic: Reference Book for Computer Scientists
- scientific article; zbMATH DE number 50432
- scientific article; zbMATH DE number 4104914
- scientific article; zbMATH DE number 49561
- Logic for informatics and artificial intelligence
- scientific article; zbMATH DE number 52096
- scientific article; zbMATH DE number 992300
- Mathematical Logic for Computer Science
- The HeKatE methodology. Hybrid engineering of intelligent systems
- scientific article; zbMATH DE number 992300 (Why is no real title available?)
- scientific article; zbMATH DE number 107624 (Why is no real title available?)
- scientific article; zbMATH DE number 193479 (Why is no real title available?)
- scientific article; zbMATH DE number 578242 (Why is no real title available?)
- Finite-state automata in information technologies
- scientific article; zbMATH DE number 814830 (Why is no real title available?)
- Functional PearlDeduction for functional programmers
- Similarity saturation for first order linear temporal logic with UNLESS
- Mathematical logic. Foundations for information science
- Mathematical logic. Foundations for information science
This page was built for publication: Mathematical logic for computer science.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2724155)
