{
  "id": "logical-conjunction",
  "title": "Logical Conjunction",
  "lang": "en",
  "source_lang": "en",
  "summary": "Logical conjunction is the connective “and,” which in classical logic forms a true statement exactly when all its constituent statements are true.",
  "category": "mathematics",
  "subcategory": "discrete-logic",
  "type": "concept",
  "aliases": [
    "Conjunction",
    "Logical AND",
    "Boolean conjunction"
  ],
  "generated_at": "2026-11-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/logical-conjunction/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/logical-conjunction/",
      "json": "https://aiwiki.page/zh/logical-conjunction.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "Logical conjunction is a logical operation that combines statements and asserts that they hold together. In classical propositional logic, the conjunction of two statements \\(P\\) and \\(Q\\), written \\(P\\land Q\\) and read “\\(P\\) and \\(Q\\),” is true exactly when both statements are true. The statements being combined are called conjuncts. Conjunction is fundamental to logic, mathematical reasoning, and computing: it expresses simultaneous conditions, combines assumptions, and underlies Boolean AND operations."
    },
    {
      "heading": "Notation and truth conditions",
      "text": "The standard symbol for conjunction is \\(\\land\\). Other notations include \\(P\\mathbin{\\&}Q\\), \\(P\\cdot Q\\), and, in algebraic contexts, juxtaposition \\(PQ\\). Programming languages commonly use &&, and, or AND, though their operational behavior varies.\n\nIn classical two-valued logic, conjunction has the following truth table:\n\n\\(P\\) | \\(Q\\) | \\(P\\land Q\\)\nTrue | True | True\nTrue | False | False\nFalse | True | False\nFalse | False | False\n\nConjunction is therefore truth-functional: its truth value depends only on the truth values of its conjuncts, not on their subject matter or any causal relationship between them.\n\nFor example, let \\(P\\) be “12 is even” and \\(Q\\) be “12 is divisible by 3.” Their conjunction is true because both statements are true. By contrast, “12 is even and 12 is prime” is false because its second conjunct is false.\n\nWith truth represented by \\(1\\) and falsity by \\(0\\), conjunction can be represented by multiplication:\n\n\\[p\\land q=pq,\\qquad p,q\\in\\{0,1\\}.\\]\n\nHere multiplication operates on the numerical encodings of truth values, rather than on the statements themselves."
    },
    {
      "heading": "Logical “and” and ordinary language",
      "text": "Logical conjunction captures an important use of the English word “and,” but not all of its meanings.\n\nIn classical logic, \\(P\\land Q\\) and \\(Q\\land P\\) have the same truth value. Ordinary language may convey additional information through word order. “She unlocked the door and entered” normally suggests a temporal sequence, whereas reversing the clauses suggests a different sequence. Conjunction alone does not express that ordering.\n\nLikewise, “He pressed the switch and the light came on” can suggest causation, but its logical conjunction asserts only that both events occurred. Any causal connection requires additional representation.\n\nNot every grammatical use of “and” combines complete propositions. “Ada and Ben lifted the piano” can describe a joint action without asserting that Ada lifted it alone and Ben lifted it alone. Translating natural language into conjunction therefore requires identifying the propositions actually being asserted."
    },
    {
      "heading": "Conjunction in formal reasoning",
      "text": "In natural deduction, conjunction is characterized by an introduction rule and two elimination rules. These rules of inference explain how a conjunction is established and what follows from it.\n\nConjunction introduction\n\nIf \\(P\\) and \\(Q\\) have each been established under compatible assumptions, their conjunction may be inferred:\n\n\\[\\frac{P\\qquad Q}{P\\land Q}\\;(\\land I).\\]\n\nMore explicitly, if a collection of assumptions \\(\\Gamma\\) permits the derivation of both statements, then\n\n\\[\\frac{\\Gamma\\vdash P\\qquad\\Gamma\\vdash Q} {\\Gamma\\vdash P\\land Q}.\\]\n\nThe symbol \\(\\vdash\\) indicates derivability in a formal proof system.\n\nConjunction elimination\n\nEither conjunct may be inferred from a conjunction:\n\n\\[\\frac{P\\land Q}{P}\\;(\\land E_1), \\qquad \\frac{P\\land Q}{Q}\\;(\\land E_2).\\]\n\nThus a proof of “\\(n\\) is positive and even” supplies a proof that \\(n\\) is positive and a proof that \\(n\\) is even. Conversely, proving those two claims establishes the conjunction. These rules are used throughout mathematical proof, including proofs of definitions that impose several requirements.\n\nA conjunction must not be confused with a conditional. \\(P\\land Q\\) asserts both statements; “if \\(P\\), then \\(Q\\)” does not generally assert either statement on its own."
    },
    {
      "heading": "Algebraic laws",
      "text": "In classical logic, conjunction satisfies the following laws. Here \\(\\equiv\\) means logical equivalence, \\(\\top\\) denotes truth, and \\(\\bot\\) denotes falsity.\n\nLaw | Equivalence\nCommutativity | \\(P\\land Q\\equiv Q\\land P\\)\nAssociativity | \\((P\\land Q)\\land R\\equiv P\\land(Q\\land R)\\)\nIdempotence | \\(P\\land P\\equiv P\\)\nIdentity | \\(P\\land\\top\\equiv P\\)\nAnnihilation | \\(P\\land\\bot\\equiv\\bot\\)\nNoncontradiction | \\(P\\land\\neg P\\equiv\\bot\\)\n\nAssociativity allows \\(P\\land Q\\land R\\) to be written without parentheses. Idempotence means that repeating a conjunct does not change the resulting truth conditions.\n\nConjunction interacts with disjunction, written \\(\\lor\\), through distributive and absorption laws:\n\n\\[P\\land(Q\\lor R) \\equiv (P\\land Q)\\lor(P\\land R),\\]\n\n\\[P\\lor(Q\\land R) \\equiv (P\\lor Q)\\land(P\\lor R),\\]\n\n\\[P\\land(P\\lor Q)\\equiv P.\\]\n\nIts relationship with negation is expressed by De Morgan’s laws:\n\n\\[\\neg(P\\land Q)\\equiv\\neg P\\lor\\neg Q,\\]\n\n\\[\\neg(P\\lor Q)\\equiv\\neg P\\land\\neg Q.\\]\n\nIn particular, denying a conjunction means that at least one conjunct is false; it does not mean that both are false. These equivalences are classical laws; some require qualification in nonclassical systems."
    },
    {
      "heading": "Boolean algebra, sets, and order",
      "text": "Conjunction is one of the basic operations of Boolean algebra. In an abstract Boolean algebra, it is called the meet operation.\n\nIts order-theoretic meaning is especially useful. Order propositions, considered up to logical equivalence, by entailment: \\(P\\leq Q\\) when \\(P\\) logically entails \\(Q\\). Then \\(P\\land Q\\) is their greatest lower bound:\n\n- \\(P\\land Q\\) entails \\(P\\) and entails \\(Q\\).\n- Any statement that entails both \\(P\\) and \\(Q\\) also entails \\(P\\land Q\\).\n\nThus conjunction combines requirements into a statement at least as strong as either requirement separately. This interpretation connects logic with partially ordered sets.\n\nIn set theory, conjunction corresponds to intersection:\n\n\\[x\\in A\\cap B \\quad\\Longleftrightarrow\\quad (x\\in A)\\land(x\\in B).\\]\n\nThe sets \\(A\\) and \\(B\\) represent two conditions on an element, and their intersection contains exactly the elements satisfying both.\n\nThis correspondence also explains conjunction in probability. For events \\(A\\) and \\(B\\), their joint occurrence is the event \\(A\\cap B\\). When \\(\\Pr(A)>0\\),\n\n\\[\\Pr(A\\cap B)=\\Pr(A)\\Pr(B\\mid A).\\]\n\nOnly under independence may the conditional probability be replaced by \\(\\Pr(B)\\). The multiplication rule for independent events is therefore not a general rule for assigning probabilities to conjunctions."
    },
    {
      "heading": "Multiple and quantified conjunctions",
      "text": "A finite family of propositions can be combined using indexed notation:\n\n\\[\\bigwedge_{i=1}^{n}P_i = P_1\\land P_2\\land\\cdots\\land P_n.\\]\n\nThis expression is true exactly when every \\(P_i\\) is true. The conjunction of an empty family is conventionally \\(\\top\\). This preserves truth as the identity element and agrees with the principle that no requirement is violated when there are no requirements.\n\nOrdinary first-order logic uses finite formulas. A universal statement such as\n\n\\[\\forall x\\,P(x)\\]\n\nrequires \\(P(x)\\) to hold for every object in the domain, but it is syntactically a quantified formula, not an infinite string of conjunctions. Over a fixed finite domain with a name for each element, it can be expanded into a finite conjunction. Some infinitary logical languages explicitly permit infinite conjunctions.\n\nConjunctions also occur within conjunctive normal form, in which a formula is expressed as a conjunction of clauses, each clause being a disjunction of literals. For example,\n\n\\[(P\\lor\\neg Q)\\land(Q\\lor R)\\]\n\nis in conjunctive normal form. This representation is central to many automated methods for testing whether propositional conditions can all be satisfied."
    },
    {
      "heading": "Computing and digital circuits",
      "text": "A digital AND gate implements conjunction on Boolean inputs: its output is \\(1\\) exactly when every input is \\(1\\). Networks of such gates, together with other logical gates, implement digital computations.\n\nIn programming, conjunction commonly combines tests, such as checking that a number lies within an interval:\n\nx >= 0 and x <= 10\n\nMany languages use short-circuit evaluation: if the first operand is false, the second is not evaluated. This matters when the second expression performs an action, raises an error, or does not terminate. Although conjunction is commutative as a Boolean operation, reversing two program expressions can therefore change program behavior.\n\nBitwise AND applies the same truth table separately to corresponding bits. For example,\n\n1100 AND 1010 = 1000\n\nBitwise and logical operators are distinct in many languages and need not have the same operand types, return types, or evaluation rules.\n\nDatabase systems provide another qualification. SQL uses a three-valued logic for many expressions involving NULL. For example, true AND unknown is unknown, while false AND unknown is false. Such behavior is not fully described by the classical two-valued truth table."
    },
    {
      "heading": "Constructive and nonclassical interpretations",
      "text": "In intuitionistic logic, conjunction retains its standard introduction and elimination rules. Under the Brouwer–Heyting–Kolmogorov interpretation, a proof of \\(P\\land Q\\) consists of a proof of \\(P\\) together with a proof of \\(Q\\). This is stronger than merely failing to refute either statement.\n\nThrough the Curry–Howard correspondence, conjunction corresponds to a product type: a value witnessing \\(P\\land Q\\) contains a component witnessing \\(P\\) and another witnessing \\(Q\\). Forming the pair corresponds to conjunction introduction; extracting its components corresponds to conjunction elimination.\n\nOther nonclassical logics may change conjunction’s semantics or distinguish multiple conjunction-like operations. Many-valued logics allow more than two truth values. Resource-sensitive logics can distinguish combining resources from offering alternative ways to use them. Consequently, notation such as \\(\\land\\) does not by itself establish that every classical Boolean law applies."
    },
    {
      "heading": "Historical development",
      "text": "Reasoning about combined assertions predates modern symbolic notation. The algebraic treatment of conjunction became central in the nineteenth century through the work of George Boole, whose logical algebra represented combinations of conditions using multiplication-like operations.\n\nLater developments in propositional logic, proof systems, and Boolean algebra established conjunction as both a connective governed by inference rules and an algebraic operation. In the twentieth century, Claude Shannon connected Boolean algebra with switching circuits, making conjunction a basic operation in the mathematical description and design of digital hardware."
    }
  ],
  "links": [
    "propositional-logic",
    "logic",
    "truth-table",
    "natural-deduction",
    "inference-rule",
    "mathematical-proof",
    "idempotence",
    "logical-disjunction",
    "logical-negation",
    "de-morgans-laws",
    "boolean-algebra",
    "partial-order",
    "set-theory",
    "probability",
    "statistical-independence",
    "first-order-logic",
    "conjunctive-normal-form",
    "and-gate",
    "intuitionistic-logic",
    "bhk-interpretation",
    "curry-howard-correspondence",
    "george-boole",
    "claude-shannon"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}