Satisfiability 1289 浏览 1关注

In mathematical logic, satisfiability and validity are elementary concepts of semantics. A formula (mathematical logic)|formula is satisfiable if it is possible to find an interpretation (logic)|interpretation (model theory|model) that makes the formula true. A formula is valid if all interpretations make the formula true. The opposites of these concepts are unsatisfiability and invalidity, that is, a formula is unsatisfiable if none of the interpretations make the formula true, and invalid if some such interpretation makes the formula false. These four concepts are related to each other in a manner exactly analogous to Aristotle's square of opposition. The four concepts can be raised to apply to whole Theory (mathematical logic)|theories: a theory is satisfiable (valid) if one (all) of the interpretations make(s) each of the axioms of the theory true, and a theory is unsatisfiable (invalid) if all (one) of the interpretations make(s) each of the axioms of the theory false. It is also...
 相关概念
 主要的会议/期刊 CORR MP AAAI DAC TIT TCS STOC JACM