Logical conjunction

From testwiki
Jump to navigation Jump to search

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 p and q may be written in various ways.  Among the most common are these:

  • pandq
  • pq
  • pq
  • pq
  • pq

A truth table for pq appears below:

Logical Conjunction
p q pq
F F F
F T F
T F F
T T T


A logical graph for pq 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 pq.  The proposition pq may be taken as a Boolean function f(p,q) having the abstract type f:𝔹×𝔹𝔹, where 𝔹={0,1} is interpreted in such a way that 0 means false and 1 means true.

A Venn diagram for pq indicates the region, in this case a single cell, where pq 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 operators

Template:Col-begin Template:Col-break

Template:Col-break

Template:Col-end

Template:Col-begin Template:Col-break

Template:Col-break

Template:Col-break

Template:Col-end

Relational concepts

Template:Col-begin Template:Col-break

Template:Col-break

Template:Col-break

Template:Col-end

Information, Inquiry

Template:Col-begin Template:Col-break

Template:Col-break

Template:Col-break

Template:Col-break

Template:Col-end

Template:Col-begin Template:Col-break

Template:Col-break

Template:Col-break

Template:Col-end

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.