gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Making index.md more informative (#24188)

Browse Source 
* Making index.md more informative

* Update index.md
This commit is contained in:
Suresh Mangs
2019-03-20 21:35:41 +05:30
committed by Paul Gamble
parent 2219a9a8dd
commit 85412ef12a
1 changed files with 5 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
guide/english/logic/satisfiability/index.md
View File

@ -3,17 +3,17 @@ title: Satisfiability
--- ---
## Satisfiability ## Satisfiability
<!-- The article goes here, in GitHub-flavored Markdown. Feel free to add YouTube videos, images, and CodePen/JSBin embeds --> Satisfiability refers to the existence of a combination of values to make the expression true. So in short, a proposition is satisfiable if there is at least one true result in its truth table, valid if all values it returns in the truth table are true.
A formula P is considered **satisfiable** if it is **sometimes** true for some assignment of true/false to the variables. A formula P is considered satisfiable if it is sometimes true for some assignment of true/false to the variables.
Example: Example:
- x ^ y : is Satisfiable with x = T, y = T - x ^ y : is Satisfiable with x = T, y = T
- x v y -> x : is Satisfiable with x = T, y = F - x v y : is Satisfiable with x = T, y = F or x = F, y = T
If there are no assignments, then it is considered Unsatisfiable. If there are no assignments, then it is considered Unsatisfiable.
#### More Information: #### More Information:
<!-- Please add any articles you think might be helpful to read before writing the article -->
[Satisfiability explained - YouTube](https://www.youtube.com/watch?v=yo7aULLUz_0)