diff --git a/docs/Public/Math/Logic/and.md b/docs/Public/Math/Logic/and.md
index 4426ecfb1..e1ec5c25d 100644
--- a/docs/Public/Math/Logic/and.md
+++ b/docs/Public/Math/Logic/and.md
@@ -1 +1,3 @@
-*And* is a logical conjunction
\ No newline at end of file
+*And* is a logical conjunction. Its output is true when both inputs are true. 
+
+An *AND* of two or more [[literal]] is called a [[product]]. 
\ No newline at end of file
diff --git a/docs/Public/Math/Logic/or.md b/docs/Public/Math/Logic/or.md
new file mode 100644
index 000000000..bf4722755
--- /dev/null
+++ b/docs/Public/Math/Logic/or.md
@@ -0,0 +1,3 @@
+*Or* is a logical disjunction. Its output is true when either input is true. 
+
+An *OR* of two or more [[literal]] is called a [[sum]]. 
\ No newline at end of file
diff --git a/docs/Public/Math/function.md b/docs/Public/Math/function.md
new file mode 100644
index 000000000..a9b95a30a
--- /dev/null
+++ b/docs/Public/Math/function.md
@@ -0,0 +1,3 @@
+A *function* relates an input and an output. [^1]
+
+[^1]: https://www.mathsisfun.com/sets/function.html
\ No newline at end of file
diff --git a/docs/Public/Math/maxterm.md b/docs/Public/Math/maxterm.md
new file mode 100644
index 000000000..9184eedab
--- /dev/null
+++ b/docs/Public/Math/maxterm.md
@@ -0,0 +1,13 @@
+*See:* [[minterm]]
+
+A *maxterm* is a sum of all [[literal]] values in a function. 
+
+If the literal is 1, it will be the complementary form of the variable ($\neg A$)
+If the literal is $0$, it will be the positive form of the literal ($A$)
+
+For example, for the function $f$ with inputs $A$, $B$, and $C$:
+- Is a maxterm: $A+\neg B+\neg C$
+- Is not a maxterm: $A+B$
+
+To find the POS:
+- Select the rows that are false and [[and]] the corresponding *maxterms*
\ No newline at end of file
diff --git a/docs/Public/Math/minterm.md b/docs/Public/Math/minterm.md
new file mode 100644
index 000000000..3d41459c8
--- /dev/null
+++ b/docs/Public/Math/minterm.md
@@ -0,0 +1,13 @@
+*See:* [[maxterm]]
+
+A *minterm* is a [[product]] of all [[literal]] values in a function. 
+
+If the literal is $1$, it will be the positive form of the literal ($A$)
+If the literal is $0$, it will be the complementary form of the literal ($\neg A$)
+
+For example, for the function $f$ with inputs $A$, $B$, and $C$:
+- Is a maxterm: $\neg ABC$
+- Is not a maxterm: $A\neg B$
+
+To find the SOP:
+- Select the rows of output that are True and [[or]] the corresponding *minterms*
\ No newline at end of file
diff --git a/docs/Public/Math/product.md b/docs/Public/Math/product.md
new file mode 100644
index 000000000..8573832c9
--- /dev/null
+++ b/docs/Public/Math/product.md
@@ -0,0 +1 @@
+A *product* is the result of a multiplication expression.
\ No newline at end of file
diff --git a/docs/Public/Math/sum.md b/docs/Public/Math/sum.md
new file mode 100644
index 000000000..3216e9e55
--- /dev/null
+++ b/docs/Public/Math/sum.md
@@ -0,0 +1 @@
+A *sum* is the result of an addition expression.
\ No newline at end of file
diff --git a/docs/Public/Software/Computer Architecture/k-maps.md b/docs/Public/Software/Computer Architecture/k-maps.md
index 6276e51dc..a33acf48f 100644
--- a/docs/Public/Software/Computer Architecture/k-maps.md	
+++ b/docs/Public/Software/Computer Architecture/k-maps.md	
@@ -1,3 +1,3 @@
-A *k-map*, or Karnaugh-map, is a way to simplify [[boolean]] expressions when you have more than two variables. [^1]
+A *k-map*, or Karnaugh Map, is a way to simplify [[boolean]] expressions when you have more than two variables. [^1]
 
 [^1]: https://study.com/academy/lesson/what-is-a-karnaugh-map-definition-examples.html
\ No newline at end of file
diff --git a/docs/Public/Software/Computer Architecture/literal.md b/docs/Public/Software/Computer Architecture/literal.md
new file mode 100644
index 000000000..82374deb2
--- /dev/null
+++ b/docs/Public/Software/Computer Architecture/literal.md	
@@ -0,0 +1,3 @@
+A *literal* is a notation for representing a fixed value in code. [^1]
+
+[^1]: https://thabo-ambrose.medium.com/what-is-a-literal-in-computer-programming-560eace90b5b
\ No newline at end of file