Click for Philosophy Web      

Homepage > Logic > Symbolic Logic  >  Logical Connectives       


Logic Homepage





Logical ConnectivesPhilosophy 103: Introduction to Logic
Conjunction, Negation, and Disjunction

Abstract: The logical operations of conjunction, negation, and disjunction (alteration) are discussed with respect to their truth-table definitions. 

  1. Truth Functionality: In order to know the truth value of the proposition which results from applying an operator to propositions, all that need be known is the definition of the operator and the truth value of the propositions used.

  2. Conjunction is a truth-functional connective similar to "and" in English and is represented in symbolic logic with the dot "  and  ".

    1. Ordinary language definition of the dot: a connective forming compound propositions which are true only in the case when both of the propositions joined by it are true.

    2. One way of expressing this definition is by way of truth tables. Consider the following examples.

      1. "John left and Carol arrived" can be symbolized as " J and C " (i. e., (without the quotation marks), so long as we remember that the statement does not mean "Carol arrived after John left" which is a simple proposition).

      2. There are four possible states of affairs which might have occurred with respect to John leaving and Carol arriving. These cases can be listed as follows in what is called a truth table.

        p q and  q

        T T T
        T F F
        F T F
        F F F

    3. Other ordinary language conjoiners besides "and" include some uses of "but," "although," "however "yet," and "nevertheless."

    4. The dot as a truth functional connective doesn't do everything that the "and" does in English. It might be thought of in terms of a "minimum common logical meaning" to conjoined statements.

      1. I.e., the temporal or causal sequence "Bill tripped and fell" cannot be transposed as "Bill fell and tripped." The clauses cannot be interchanged.

      2. Truth functional connectives are more limited than their corresponding English connectives: the whole meaning of the truth functional connective is given in its truth table.

      3. So long as we do not expect more from truth-functional connectives, there should be few difficulties in translation.

    5. Some characteristics of conjunction (in mathematical jargon) include:

      1. associative—internal grouping is immaterial
        I. e.," [(and  q)  and  r] " is equivalent to " [and (q  and  r)] ".

      2. communicative—order is immaterial
        I. e., " p and q " is an equivalent expression to " q and p ".

      3. idempotent—reduction of repetition
        I. e., " p and p " is an equivalent expression to " p ".

  3. Which brings us to an overdue additional convention:  lower-case letters are variables, the small letters of the English alphabet usually beginning with letters after " p "(toward the end of the alphabet).

    1. A variable is not a proposition, but is a "place holder" for any proposition.

    2. Think of a variable as a "labeled box" which can be filled with any proposition, so long as we set up a correspondence between the "labeled box" and the variable.

    3. E. g., just as "All S is P" is the form of statements like "All men are mortal" and "The whale is a mammal," " p and q " is the form of statements like "John left and Carol arrived" and " J and C " (which symbolizes the statement "John left and Carol arrived."

    4. E. g., suppose Alice and Betty are in this room, but Charles is not. The form of the statement corresponding to each person being in the room  is

      [(and  q)  and  r]

      and the statement "Alice is in this room and Betty is in this room, and Charles is  in this room" can, itself, be symbolized as

      [(and  B)  and  C]

      The truth of the compound expression is analyzed by substituting in the truth values corresponding to the facts of the case, viz.,

      [(and  T)  and  F]

      so by the meaning of the " and " the compound statement resolves to being false by the following step-by-step analysis in accordance with the truth table for conjunction:

      [(and  T)  and  F]
      [( T )  and  F]
      [ and  F]

  4. Disjunction (or as it is sometimes called, alternation) is a connective which forms compound propositions which are false only if both statements (disjuncts) are false.

    1. The connective "or" in English is quite different from disjunction. "Or" in English has two quite distinctly different senses.

      1. The exclusive sense of "or" is "Either A or B (but not both)" as in "You may go to the left or to the right." In Latin, the word is "aut."

      2. The inclusive sense of "or" is "Either A or B {or both)." as om "John is at the library or John is studying." In Latin, the word is vel."

    2. It is the second  sense that we use the "vel" or "wedge" symbol:
      or "

    3. The truth table definition of the wedge is

      p q   or  q

      T T T
      T F T
      F T T
      F F F

    4. Consider the statement, "John is at the Library or he is Studying." If, in this example, John is not at the library and John is not studying, then the truth value of the complex statement is false:

      F  or 

  5. Another truth functional operator is negation:  the phrase "It is false that …" or "not" inserted in the appropriate place in a statement.

    1. The phrase is usually represented by a minus sign " - " or a tilde "~"

    2. For example, "It is not the case that Bill is a curious child" can be represented by "~B".

    3. The truth table for negation is as follows:

      p ~ p

      T F
      F T

  6. The general principles that govern parentheses for grouping are as follows. 

    1. A " ~ " standing in front of a letter negates only that proposition, while a " ~ " in front of an expression in parentheses negates the whole compound statement within those parentheses.

      Note the difference between: ~ A  and  B and ~( A  and  B ).

    2. Each occureence of a connective has associated with it a set of parentheses which indicate what it is connecting.

      Hence, ( A  and  B ) or C is quite different from A  and ( B or C )

      E. g., let A and B be false, and let C be true. The resolution of the truth value of these expressions would be as follows.

      ( A  and  B ) or C  
      ( F  and  F )  or  T
      or  T
      A  and  ( B or C )
      and  ( F  or  T )
      and  T

Return to Logic Homepage   

Previous: The Language of Symbolic Logic      Next: Conditional Statements and Material Implication

Send corrections or suggestions to
Read the disclaimer concerning this page.
10.12.05         2004  Licensed under GFDL

Arguments | LanguageFallacies  | Propositions  | Syllogisms  | Translation  | Symbolic


[an error occurred while processing this directive]