Mathematical Logic for Computer Science

DOI10.1007/978-1-4471-4129-7zbMath1248.03001OpenAlexW4298236051MaRDI QIDQ2894076

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

verificationmodel checkingtemporal logiclogic programmingclassical logicSAT solversbinary decision algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Classical first-order logic (03B10) Mechanization of proofs and logical operations (03B35) Mathematics for nonmathematicians (engineering, social sciences, etc.) (00A06) Classical propositional logic (03B05) Logic programming (68N17) Temporal logic (03B44) Logic (educational aspects) (97E30) Theoretical computer science (educational aspects) (97P20)

Related Items (15)

On logical and extensional characterizations of attributed feature models ⋮ Formalization of the resolution calculus for first-order logic ⋮ A first polynomial non-clausal class in many-valued logic ⋮ Keeping logic in the trivium of computer science: a teaching perspective ⋮ Enumerating, cataloguing and classifying all quantales on up to nine elements ⋮ \textsf{PFL}: a probabilistic logic for fault trees ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Decomposition for a new kind of imprecise information system ⋮ A SIMPLE ALGORITHM FOR DEDUCTION ⋮ Fifty years of Hoare's logic ⋮ Formalization of the Resolution Calculus for First-Order Logic ⋮ Colored cut games ⋮ Can you answer while you wait? ⋮ The possibilistic Horn non-clausal knowledge bases

This page was built for publication: Mathematical Logic for Computer Science