Logic for computer scientists

DOI10.1007/978-0-8176-4763-6zbMath1206.03001OpenAlexW4252344653WikidataQ63971809 ScholiaQ63971809MaRDI QIDQ5894107

Uwe Schoening

Publication date: 10 February 2011

Published in: Modern Birkhäuser Classics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-0-8176-4763-6

zbMATH Keywords

propositional logicPROLOGlogic programmingpredicate logicautomated deductionprogram verificationresolution-based theorem provingsemantics of programming languages

Mathematics Subject Classification ID

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) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Classical first-order logic (03B10) Mechanization of proofs and logical operations (03B35) Classical propositional logic (03B05) Logic programming (68N17)

Related Items (2)

The fraction of large random trees representing a given Boolean function in implicational logic ⋮ Generalized satisfiability problems via operator assignments

This page was built for publication: Logic for computer scientists