Definition:Disjunction

Disjunction is a binary connective written symbolically as $$p \lor q$$ whose behaviour is as follows:

$$p \lor q$$ is defined as: "either $$p$$ is true or $$q$$ is true or possibly both."

This is called the disjunction of $$p$$ and $$q$$.

The statements $$p$$ and $$q$$ are known as the disjuncts.

The symbol "$$\lor$$" is called "vel".

This usage of "or", that allows the case where both disjuncts are true, is called "inclusive or".

"$$p \lor q$$ is voiced "$$p$$ or $$q$$".

You may encounter different symbols which mean the same thing as $$p \lor q$$, for example, $$p + q$$.