Difference between revisions of "Logical conjunction"
MyWikiBiz, Author Your Legacy — Friday April 26, 2024
Jump to navigationJump to searchJon Awbrey (talk | contribs) (use column template) |
Jon Awbrey (talk | contribs) |
||
| Line 21: | Line 21: | ||
==See also== | ==See also== | ||
| + | |||
===Logical operators=== | ===Logical operators=== | ||
| Line 55: | Line 56: | ||
* [[Zeroth order logic]] | * [[Zeroth order logic]] | ||
{{col-end}} | {{col-end}} | ||
| − | |||
| − | |||
[[Category:Computer Science]] | [[Category:Computer Science]] | ||
| Line 67: | Line 66: | ||
[[Category:Philosophy]] | [[Category:Philosophy]] | ||
[[Category:Semiotics]] | [[Category:Semiotics]] | ||
| + | |||
| + | <sharethis /> | ||
Revision as of 14:15, 25 May 2009
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 |
