Difference between revisions of "Logical conjunction"
MyWikiBiz, Author Your Legacy — Sunday November 24, 2024
Jump to navigationJump to searchJon Awbrey (talk | contribs) |
Jon Awbrey (talk | contribs) |
||
| Line 156: | Line 156: | ||
* [http://en.wikipedia.org/w/index.php?title=Logical_conjunction&oldid=75153420 Logical Conjunction], [http://en.wikipedia.org/ Wikipedia] | * [http://en.wikipedia.org/w/index.php?title=Logical_conjunction&oldid=75153420 Logical Conjunction], [http://en.wikipedia.org/ Wikipedia] | ||
{{col-end}} | {{col-end}} | ||
| − | |||
| − | |||
[[Category:Inquiry]] | [[Category:Inquiry]] | ||
Revision as of 15:18, 16 May 2012
☞ 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 ~\operatorname{AND}~ q,\) also written \(p \land q\!\) or \(p \cdot q,\!\) appears below:
| \(p\!\) | \(q\!\) | \(p \land q\) |
| \(\operatorname{F}\) | \(\operatorname{F}\) | \(\operatorname{F}\) |
| \(\operatorname{F}\) | \(\operatorname{T}\) | \(\operatorname{F}\) |
| \(\operatorname{T}\) | \(\operatorname{F}\) | \(\operatorname{F}\) |
| \(\operatorname{T}\) | \(\operatorname{T}\) | \(\operatorname{T}\) |
Syllabus
Focal nodes
Template:Col-breakTemplate:Col-breakTemplate:Col-endPeer nodes
- Logical Conjunction @ MyWikiBiz
- Logical Conjunction @ InterSciWiki
- Logical Conjunction @ OER Commons
- Logical Conjunction @ P2P Foundation
- Logical Conjunction @ Subject Wikis
- Logical Conjunction @ Wikiversity Beta
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.
