Mathematical Logic for Computer Science
DOI10.1007/978-1-4471-4129-7zbMATH Open1248.03001OpenAlexW4298236051MaRDI QIDQ2894076FDOQ2894076
Authors: Mordechai Ben-Ari 
Publication date: 27 June 2012
Full work available at URL: https://doi.org/10.1007/978-1-4471-4129-7
Recommendations
- scientific article; zbMATH DE number 1615755
- Introduction to propositional satisfiability
- Publication:4953875
- 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
verificationmodel checkingtemporal logicclassical logicSAT solverslogic programmingbinary decision algorithm
Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Classical propositional logic (03B05) Logic programming (68N17) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematics for nonmathematicians (engineering, social sciences, etc.) (00A06) 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 mathematical logic and foundations (03-01) Logic (educational aspects) (97E30) Theoretical computer science (educational aspects) (97P20)
Cited In (22)
- Can you answer while you wait?
- The possibilistic Horn non-clausal knowledge bases
- On logical and extensional characterizations of attributed feature models
- Formalization of the resolution calculus for first-order logic
- Fifty years of Hoare's logic
- Title not available (Why is that?)
- A new rule for LTL tableaux
- Enumerating, cataloguing and classifying all quantales on up to nine elements
- \textsf{PFL}: a probabilistic logic for fault trees
- Verifying a sequent calculus Prover for first-order logic with functions in Isabelle/HOL
- A simple algorithm for deduction
- Formalization of the Resolution Calculus for First-Order Logic
- On the decidability of a fragment of preferential LTL
- Colored cut games
- Title not available (Why is that?)
- Mathematical logic. Foundations for information science
- A first polynomial non-clausal class in many-valued logic
- SeCaV: a sequent calculus verifier in Isabelle/HOL
- Keeping logic in the trivium of computer science: a teaching perspective
- A naive prover for first-order logic: a minimal example of analytic completeness
- Logic in Computer Science
- Decomposition for a new kind of imprecise information system
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)
