The final truth really depends on the then proposition. In this case, q = p->q.

Use a lot in code. They are called "if statements"

A truth table shows all the possible outcomes of a proposition conjunction.

Different than the normal "or" operation! In the regular "or" operation if 1 or both are are true than it is true. In the "exclusive or" only if 1 is true than it is true.

Sometimes two things can be true but are not related so it is hard to use "and" to combine them in words so you can use other conjunction words as seen in the table below.

This will be false because q is false even though p is true.