diff --git a/guide/english/logic/satisfiability/index.md b/guide/english/logic/satisfiability/index.md
index 5a660da0f9..83ab92fcee 100644
--- a/guide/english/logic/satisfiability/index.md
+++ b/guide/english/logic/satisfiability/index.md
@@ -3,17 +3,17 @@ title: 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:
   - 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.
 
 
-
 #### 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)