Difference between revisions of "Logical disjunction"
MyWikiBiz, Author Your Legacy — Friday November 29, 2024
Jump to navigationJump to searchJon Awbrey (talk | contribs) |
Jon Awbrey (talk | contribs) |
||
| Line 162: | Line 162: | ||
[[Category:Open Educational Resource]] | [[Category:Open Educational Resource]] | ||
[[Category:Peer Educational Resource]] | [[Category:Peer Educational Resource]] | ||
| + | [[Category:Charles Sanders Peirce]] | ||
[[Category:Computer Science]] | [[Category:Computer Science]] | ||
[[Category:Formal Languages]] | [[Category:Formal Languages]] | ||
Revision as of 01:01, 2 November 2011
☞ This page belongs to resource collections on Logic and Inquiry.
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 |
Syllabus
Focal nodes
Template:Col-breakTemplate:Col-breakTemplate:Col-endPeer nodes
- Logical Disjunction @ MyWikiBiz
- Logical Disjunction @ MathWeb Wiki
- Logical Disjunction @ NetKnowledge
- Logical Disjunction @ OER Commons
- Logical Disjunction @ P2P Foundation
- Logical Disjunction @ SemanticWeb
Logical operators
Related topics
- Propositional calculus
- Sole sufficient operator
- Truth table
- Universe of discourse
- Zeroth order logic
Relational concepts
Information, Inquiry
Related articles
Document history
Portions of the above article were adapted from the following sources under the GNU Free Documentation License, under other applicable licenses, or by permission of the copyright holders.
<sharethis />
