Difference between revisions of "Logical conjunction"
MyWikiBiz, Author Your Legacy — Thursday November 21, 2024
Jump to navigationJump to searchJon Awbrey (talk | contribs) (table colors → table body (#f8f8ff = ghostwhite) table head (#e6e6ff = blue gray)) |
Jon Awbrey (talk | contribs) (standardize syllabus + [document history]) |
||
| Line 23: | Line 23: | ||
<br> | <br> | ||
| − | == | + | ==Syllabus== |
===Logical operators=== | ===Logical operators=== | ||
| Line 45: | Line 45: | ||
{{col-break}} | {{col-break}} | ||
* [[Ampheck]] | * [[Ampheck]] | ||
| − | |||
* [[Boolean domain]] | * [[Boolean domain]] | ||
* [[Boolean function]] | * [[Boolean function]] | ||
| + | * [[Boolean-valued function]] | ||
{{col-break}} | {{col-break}} | ||
| − | |||
| − | |||
| − | |||
* [[Logical graph]] | * [[Logical graph]] | ||
| + | * [[Logical matrix]] | ||
| + | * [[Minimal negation operator]] | ||
| + | * [[Peirce's law]] | ||
{{col-break}} | {{col-break}} | ||
| − | |||
* [[Propositional calculus]] | * [[Propositional calculus]] | ||
| − | * [[ | + | * [[Truth table]] |
| + | * [[Universe of discourse]] | ||
* [[Zeroth order logic]] | * [[Zeroth order logic]] | ||
{{col-end}} | {{col-end}} | ||
| + | |||
| + | ==Document history== | ||
| + | |||
| + | <br><sharethis /> | ||
[[Category:Computer Science]] | [[Category:Computer Science]] | ||
| Line 69: | Line 73: | ||
[[Category:Philosophy]] | [[Category:Philosophy]] | ||
[[Category:Semiotics]] | [[Category:Semiotics]] | ||
| − | |||
| − | |||
Revision as of 18:54, 6 April 2010
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
Logical operators
Template:Col-breakTemplate:Col-breakTemplate:Col-endRelated topics
Document history
<sharethis />
