Difference between revisions of "Logical disjunction"
MyWikiBiz, Author Your Legacy — Thursday November 14, 2024
Jump to navigationJump to searchJon Awbrey (talk | contribs) (copy text from [http://www.opencycle.net/ OpenCycle] of which Jon Awbrey is the sole author) |
Jon Awbrey (talk | contribs) (+ {{aficionados}} <sharethis /> + cats) |
||
| Line 52: | Line 52: | ||
* [[Zeroth order logic]] | * [[Zeroth order logic]] | ||
|} | |} | ||
| + | |||
| + | {{aficionados}}<sharethis /> | ||
| + | |||
| + | [[Category:Computer Science]] | ||
| + | [[Category:Formal Languages]] | ||
| + | [[Category:Formal Sciences]] | ||
| + | [[Category:Formal Systems]] | ||
| + | [[Category:Linguistics]] | ||
| + | [[Category:Logic]] | ||
| + | [[Category:Mathematics]] | ||
| + | [[Category:Philosophy]] | ||
| + | [[Category:Semiotics]] | ||
Revision as of 14:36, 21 May 2007
Logical disjunction, also called logical alternation, is an operation on two logical values, typically the values of two propositions, 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:
| p | q | p ∨ q |
|---|---|---|
| F | F | F |
| F | T | T |
| T | F | T |
| T | T | T |
See also
Logical operators
Related topics
Aficionados
- See Talk:Logical disjunction for discussions/comments regarding this article.
- See Logical disjunction/Aficionados for those who have listed Logical disjunction as an interest.
- See Talk:Logical disjunction/Aficionados for discussions regarding this interest.
<sharethis />
