Logical conjunction
Template:Font 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.
A logical conjunction of propositions and may be written in various ways. Among the most common are these:
A truth table for appears below:
A logical graph for is drawn as two letters attached to a root node:
| File:Cactus Graph Existential P And Q.jpg |
Written as a string, this is just the concatenation The proposition may be taken as a Boolean function having the abstract type where is interpreted in such a way that means and means
A Venn diagram for indicates the region, in this case a single cell, where is true by means of a distinct color or shading, as shown below:
| File:Venn Diagram P And Q.jpg |
Syllabus
Focal nodes
Peer nodes
- Logical Conjunction @ InterSciWiki
- Logical Conjunction @ Subject Wikis
- Logical Conjunction @ Wikiversity
- Logical Conjunction @ Wikiversity Beta
Logical operators
Template:Col-begin Template:Col-break
Related topics
Template:Col-begin Template:Col-break
- Propositional calculus
- Sole sufficient operator
- Truth table
- Universe of discourse
- Zeroth order logic
Relational concepts
Template:Col-begin Template:Col-break
Information, Inquiry
Template:Col-begin Template:Col-break
Related articles
Template:Col-begin Template:Col-break
- Differential Logic : Introduction
- Differential Propositional Calculus
- Differential Logic and Dynamic Systems
- Prospects for Inquiry Driven Systems
- Introduction to Inquiry Driven Systems
- Inquiry Driven Systems : Inquiry Into Inquiry
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.