Mathematical Logic for Computer Science

DOI10.1007/978-1-4471-4129-7MaRDI QIDQ2894076zbMATH OpenOpenAlexFDO

Authors Mordechai Ben-Ari

Publication date 27 June 2012

Full work available at URL https://doi.org/10.1007/978-1-4471-4129-7

zbMATH Keywords

binary decision algorithmclassical logiclogic programmingmodel checkingSAT solverstemporal logicverification

Mathematics Subject Classification ID

Mathematics for nonmathematicians (engineering, social sciences, etc.) (00A06) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Classical propositional logic (03B05) Classical first-order logic (03B10) 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) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Logic (educational aspects) (97E30) Theoretical computer science (educational aspects) (97P20)

Recommendations

• scientific article; zbMATH DE number 1615755
• Introduction to propositional satisfiability
• scientific article; zbMATH DE number 1446599
• scientific article; zbMATH DE number 52096
• Logic and language models for computer science
• scientific article; zbMATH DE number 53085
• Introduction to Mathematics of Satisfiability
• Logic for informatics and artificial intelligence
• scientific article; zbMATH DE number 992300

Cited in

(25)

• Formalization of the resolution calculus for first-order logic
• Keeping logic in the trivium of computer science: a teaching perspective
• Decomposition for a new kind of imprecise information system
• Colored cut games
• Can you answer while you wait?
• The possibilistic Horn non-clausal knowledge bases
• On logical and extensional characterizations of attributed feature models
• Fifty years of Hoare's logic
• Formalization of the Resolution Calculus for First-Order Logic
• A simple algorithm for deduction
• scientific article; zbMATH DE number 1852932 (Why is no real title available?)
• Logic in Computer Science
• A new rule for LTL tableaux
• scientific article; zbMATH DE number 5063195 (Why is no real title available?)
• Mathematical logic. Foundations for information science
• On the decidability of a fragment of preferential LTL
• A first polynomial non-clausal class in many-valued logic
• Enumerating, cataloguing and classifying all quantales on up to nine elements
• \textsf{PFL}: a probabilistic logic for fault trees
• A naive prover for first-order logic: a minimal example of analytic completeness
• Verifying a sequent calculus Prover for first-order logic with functions in Isabelle/HOL
• SeCaV: a sequent calculus verifier in Isabelle/HOL
• Colored cut games
• Can't you answer while you wait?
• Hypothetical answers to continuous queries over data streams

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 Q2894076)