Difference between revisions of "Logical conjunction"
MyWikiBiz, Author Your Legacy — Monday November 25, 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 conjunction is an operation on two logical values, typically the values of two propositions, that produces a value of true if and only if both of its operands are true.
The truth table of p AND q (also written as p ∧ q, p & q, or p\(\cdot\)q) is as follows:
| p | q | p ∧ q |
|---|---|---|
| F | F | F |
| F | T | F |
| T | F | F |
| T | T | T |
Syllabus
Focal nodes
Template:Col-breakTemplate:Col-breakTemplate:Col-endPeer nodes
- Logical Conjunction @ MyWikiBiz
- Logical Conjunction @ MathWeb Wiki
- Logical Conjunction @ NetKnowledge
- Logical Conjunction @ OER Commons
- Logical Conjunction @ P2P Foundation
- Logical Conjunction @ 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 />
