Linked from

The 14 pages that link to Satisfiability, each with the reason it gives.

• Propositional logicRelated: Satisfiability distinguishes formulas true in some assignments from contradictions.

• ConsistencyCompared with: For standard sound classical systems, satisfiability supplies a semantic route to consistency, but the notions differ.

• Compactness theoremRelated: Compactness equates satisfiability of a theory with satisfiability of all its finite subsets.

• ContradictionCompared with: A set of claims is contradictory when no interpretation satisfies them all.

• EntscheidungsproblemRelated: For first-order logic, satisfiability is undecidable and is linked to validity by negation.

• Interpretation (logic)Related: Interpretations witness whether a formula or theory can be true at all.

• Logical equivalenceRelated: Equivalence can be tested by checking whether the formulas’ exclusive difference is unsatisfiable.

• Existential quantificationRelated: Satisfiability asks whether some assignment witnesses a formula's truth.

• TreewidthRelated: Structural decompositions can make satisfiability instances tractable when their interaction graphs have bounded treewidth.

• Existence theoremRelated: An existence claim can be read as asking whether its conditions have a satisfying instance.

• Well-formed formulaCompared with: A well-formed formula can still have no satisfying interpretation.

• Automated reasoningRelated: A solver can test satisfiability to find a model or establish that no model exists.

• Herbrand's theoremCompared with: Refuting validity often becomes finding satisfiability in the negated formula's ground instances.

• Universe (mathematics and logic)Related: A theory's satisfiability depends on whether some universe supports its axioms.