Math 2.0

Mathematical logic and foundations Definition

Disjunction

Builds on Proposition

Definition

Let pp and qq be propositions. The disjunction of pp and qq is the proposition p∨qp \lor q, read "pp or qq". The proposition p∨qp \lor q is false when pp is false and qq is false. In all other cases, p∨qp \lor q is true.

pp qq p∨qp \lor q
T T T
T F T
F T T
F F F

Remarks

This "or" is inclusive: p∨qp \lor q is true when both pp and qq are true. The exclusive "or" is true when exactly one of pp and qq is true. The union of two sets uses disjunction: x∈A∪Bx \in A \cup B means x∈A∨x∈Bx \in A \lor x \in B.

Reading path

To understand this page from the ground up, read these 2 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Proposition concept
  2. Disjunction definition

Where this leads

837 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Logical_disjunction, lead section
About this page
Tag0H5GKDTB01
URIm2://0H5GKDTB01
Kinddefinition
WritingW1 stated
MSC03B05
DefinesDisjunction
UsesProposition

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by