For classical logics with negation, it is generally possible to re-express the question of the validity of a formula to one involving satisfiability, … 展开

For first-order logic (FOL), satisfiability is undecidable. More specifically, it is a co-RE-complete problem and therefore not semidecidable. This fact has to do with the undecidability of the validity problem for FOL. The question of the status of the validity problem was … 展开

• 2-satisfiability
• Boolean satisfiability problem
• Circuit satisfiability
• Karp's 21 NP-complete problems
• Validity 展开

In the case of classical propositional logic, satisfiability is decidable for propositional formulae. In particular, satisfiability is an NP-complete problem, … 展开

In model theory, an atomic formula is satisfiable if there is a collection of elements of a structure that render the formula true. If A is a … 展开

A problem related to satisfiability is that of finite satisfiability, which is the question of determining whether a formula admits a finite model that makes it … 展开

• Daniel Kroening; Ofer Strichman (2008). Decision Procedures: An Algorithmic Point of View. Springer Science & Business Media. ISBN 展开