Satisfiability
In mathematical logic, satisfiability and validity are elementary concepts of semantics. A formula is satisfiable if it is possible to find an interpretation (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.
Wikipage disambiguates
Action languageAllan Sly (mathematician)Atomic formulaAxiomBarwise compactness theoremBelief propagationBernays–Schönfinkel classBoolean algebras canonically definedBoolean satisfiability problemBruce Reed (mathematician)Circuit satisfiability problemConjunctive normal formConsistencyConstraint satisfactionContradictionCourcelle's theoremDavis–Putnam algorithmDiagrammatic reasoningDiophantine setDouble turnstileDuality (mathematics)Dynamic epistemic logicEntitative graphEquisatisfiabilityEternity II puzzleEugene LawlerExistential graphExpert systemFastestFinite satisfiability (logics)Fragment (logic)Generic-case complexityGlossary of artificial intelligenceHerbrand interpretationHerbrandizationIndex of logic articlesIndex of philosophy articles (R–Z)Interpretation (logic)Laws of Form
Link from a Wikipage to another Wikipage
seeAlso
primaryTopic
Satisfiability
In mathematical logic, satisfiability and validity are elementary concepts of semantics. A formula is satisfiable if it is possible to find an interpretation (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.
has abstract
En logique mathématique, la sa ...... on rend l'un des axiomes faux.
@fr
En lógica proposicional, la sa ...... verdadera.
* Datos: Q1350299
@es
In de klassieke logica is een ...... idstabel worden gecontroleerd.
@nl
In mathematical logic, satisfi ...... e-free or on other conditions.
@en
Na lógica matemática, satisfat ...... l ou está em outras condições.
@pt
V logice představuje splniteln ...... ní všech instancí SAT.[zdroj?]
@cs
قابلية الإرضاء تعبير في الرياضيات وفي نظرية التعقيد الحسابي ذو أهمية كبيرة جدا.
@ar
Wikipage page ID
23,401,166
page length (characters) of wiki page
Wikipage revision ID
1,018,331,034
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
type
comment
En logique mathématique, la sa ...... on qui rend la formule fausse.
@fr
En lógica proposicional, la sa ...... verdadera.
* Datos: Q1350299
@es
In de klassieke logica is een ...... idstabel worden gecontroleerd.
@nl
In mathematical logic, satisfi ...... stotle's square of opposition.
@en
Na lógica matemática, satisfat ...... das oposições de Aristóteles.
@pt
V logice představuje splniteln ...... a při kterých výraz (a AND b)
@cs
قابلية الإرضاء تعبير في الرياضيات وفي نظرية التعقيد الحسابي ذو أهمية كبيرة جدا.
@ar
label
Erfüllbarkeit
@de
Satisfacibilidad
@es
Satisfaisabilité
@fr
Satisfatibilidade
@pt
Satisfiability
@en
Splnitelnost
@cs
Vervulbaarheid
@nl
قابلية الإرضاء
@ar