Satisfiability
id:
satisfiability-283-15732632
title:
Satisfiability
text:
In mathematical logic, a formula is satisfiable if it is true under some assignment of values to its variables. For example, the formula x + 3 = y is satisfiable because it is true when x = 3 and y = 6 , while the formula x + 1 = x is not satisfiable over the integers. The dual concept to satisfiability is validity; a formula is valid if every assignment of values to its variables makes the formula true. For example, x + 3 = 3 + x is valid over the integers, but x + 3 = y is not. Formally, satis
brand slug:
wiki
category slug:
encyclopedia
description:
Concept in mathematical logic
original url:
https://en.wikipedia.org/wiki/Satisfiability
date created:
date modified:
2022-11-26T18:45:39Z
main entity:
{"identifier":"Q1350299","url":"https://www.wikidata.org/entity/Q1350299"}
image:
fields total:
13
integrity:
14