Changes

MyWikiBiz, Author Your Legacy — Sunday September 07, 2025
Jump to navigationJump to search
1,307 bytes added ,  14:16, 21 May 2007
copy text from [http://www.opencycle.net/ OpenCycle] of which Jon Awbrey is the sole author
'''Logical disjunction''', also called '''logical alternation''', is an [[logical operation|operation]] on two [[logical value]]s, typically the values of two [[proposition]]s, that produces a value of ''false'' if and only if both of its operands are false.

The [[truth table]] of '''p OR q''' (also written as '''p ∨ q''') is as follows:

{| align="center" border="1" cellpadding="8" cellspacing="0" style="background:lightcyan; font-weight:bold; text-align:center; width:45%"
|+ '''Logical Disjunction'''
|- style="background:paleturquoise"
! style="width:15%" | p
! style="width:15%" | q
! style="width:15%" | p ∨ q
|-
| F || F || F
|-
| F || T || T
|-
| T || F || T
|-
| T || T || T
|}
<br>

==See also==
===Logical operators===
{|
| valign=top |
* [[Exclusive disjunction]]
* [[Logical conjunction]]
* [[Logical disjunction]]
* [[Logical equality]]
| valign=top |
* [[Logical implication]]
* [[Logical NAND]]
* [[Logical NNOR]]
* [[Logical negation|Negation]]
|}
===Related topics===
{|
| valign=top |
* [[Ampheck]]
* [[Boolean algebra]]
* [[Boolean domain]]
* [[Boolean function]]
| valign=top |
* [[Boolean logic]]
* [[Laws of Form]]
* [[Logic gate]]
* [[Logical graph]]
| valign=top |
* [[Peirce's law]]
* [[Propositional calculus]]
* [[Sole sufficient operator]]
* [[Zeroth order logic]]
|}
12,089

edits

Navigation menu