Logical disjunction
Logical connective OR
In logic, disjunction (also known as logical disjunction, logical or, logical addition, or inclusive disjunction) is a logical connective typically notated as ∨ and read aloud as "or". For instance, the English language sentence "it is sunny or it is warm" can be represented in logic using the disjunctive formula S ∨ W, assuming that S abbreviates "it is sunny" and W abbreviates "it is warm".
Nº Q1651704 ★★★
Rare · Knowledge
Logical disjunction
Logical connective OR
In logic, disjunction (also known as logical disjunction, logical or, logical addition, or inclusive disjunction) is a logical connective typically notated as ∨ and read aloud as "or". For instance, the English language sentence "it is sunny or it is warm" can be represented in logic using the disjunctive formula S ∨ W, assuming that S abbreviates "it is sunny" and W abbreviates "it is warm".
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
In logic, disjunction (also known as logical disjunction, logical or, logical addition, or inclusive disjunction) is a logical connective typically notated as ∨ and read aloud as "or". For instance, the English language sentence "it is sunny or it is warm" can be represented in logic using the disjunctive formula S ∨ W, assuming that S abbreviates "it is sunny" and W abbreviates "it is warm". In classical logic, disjunction is given a truth functional semantics according to which a formula ϕ ∨ ψ {\displaystyle \phi \lor \psi } is true unless both ϕ {\displaystyle \phi } and ψ {\displaystyle \psi } are false. Because this semantics allows a disjunctive formula to be true when both of its disjuncts are true, it is an inclusive interpretation of disjunction, in contrast with exclusive disjunction. Classical proof theoretical treatments are often given in terms of rules such as disjunction introduction and disjunction elimination. Disjunction has also been given numerous non-classical treatments, motivated by problems including Aristotle's sea battle argument, Heisenberg's uncertainty principle, as well as the numerous mismatches between classical disjunction and its nearest equivalents in natural languages. An operand of a disjunction is a disjunct.
Text: Wikipédia, CC BY-SA 4.0. · Image: Wikimedia Commons (Public domain) ·
Related cards
Logical conjunction
Logical connective AND
Nº Q191081 ★★★
Negation
Operation that takes a proposition p to another proposition "not p", written ¬p, which is interpreted intuitively as being true when p is false, and false when p is true; unary (single-argument) logical connective
Nº Q190558 ★★
Exclusive or
True when either but not both inputs are true
Nº Q498186 ★★★
If and only if
Logical connective
Nº Q949972 ★★★
Logical consequence
Fundamental concept in logic
Nº Q374182 ★★
Modal logic
Formal logic able to express concepts such as necessity, possibility, provability, obligation, knowledge etc.
Nº Q210841 ★★★