# Chapter A: Symbolic notation

- Page ID
- 1071

In the history of formal logic, different symbols have been used at different times and by different authors. Often, authors were forced to use notation that their printers could typeset.

In one sense, the symbols used for various logical constants is arbitrary. There is nothing written in heaven that says that ‘¬’ must be the symbol for truthfunctional negation. We might have specified a different symbol to play that part. Once we have given definitions for well-formed formulae (wff) and for truth in our logic languages, however, using ‘¬’ is no longer arbitrary. That is the symbol for negation in this textbook, and so it is the symbol for negation when writing sentences in our languages SL or QL.

This appendix presents some common symbols, so that you can recognize them if you encounter them in an article or in another book.

**summary of symbols**

negation ¬, ∼

conjunction &, ∧, •

disjunction ∨

conditional →, ⊃

biconditional ↔, ≡

**Negation** Two commonly used symbols are the hoe, ‘¬’, and the *swung dash*, ‘∼.’ In some more advanced formal systems it is necessary to distinguish between two kinds of negation; the distinction is sometimes represented by using both ‘¬’ and ‘∼.’

**Disjunction** The symbol ‘∨’ is typically used to symbolize inclusive disjunction.

**Conjunction** Conjunction is often symbolized with the ampersand, ‘&.’ The ampersand is actually a decorative form of the Latin word ‘et’ which means ‘and’; it is commonly used in English writing. As a symbol in a formal system, the ampersand is not the word ‘and’; its meaning is given by the formal semantics for the language. Perhaps to avoid this confusion, some systems use a different symbol for conjunction. For example, ‘∧’ is a counterpart to the symbol used for disjunction. Sometimes a single dot, ‘•’, is used. In some older texts, there is no symbol for conjunction at all; ‘\(A\) and \(B\)’ is simply written ‘\(AB\).’

**Material Conditional** There are two common symbols for the material conditional: the arrow, ‘→’, and the hook, ‘⊃.’

**Material Biconditional **The double-headed arrow, ‘↔’, is used in systems that use the arrow to represent the material conditional. Systems that use the hook for the conditional typically use the triple bar, ‘≡’, for the biconditional.

**Quantifiers** The universal quantifier is typically symbolized as an upsidedown A, ‘∀’, and the existential quantifier as a backwards E, ‘∃.’ In some texts, there is no separate symbol for the universal quantifier. Instead, the variable is just written in parentheses in front of the formula that it binds. For example, ‘all \(x\) are \(P\)’ is written (\(x\))\(P\) \(x\).

In some systems, the quantifiers are symbolized with larger versions of the symbols used for conjunction and disjunction. Although quantified expressions cannot be translated into expressions without quantifiers, there is a conceptual connection between the universal quantifier and conjunction and between the existential quantifier and disjunction. Consider the sentence ∃\(xPx\), for example. It means that either the first member of the UD is a \(P\), or the second one is, *or* the third one is, . . . . Such a system uses the symbol ‘\(⋁\)’ instead of ‘∃.’

## Polish notation

Notation of SL Polish notation

¬ & ∨ → ↔ \(N\) \(K\) \(A\) \(C\) \(E\)

This section briefly discusses sentential logic in Polish notation, a system of notation introduced in the late 1920s by the Polish logician Jan Lukasiewicz.

Lower case letters are used as sentence letters. The capital letter \(N\) is used for negation. \(A\) is used for disjunction, \(K\) for conjunction, \(C\) for the conditional, \(E\) for the biconditional. (‘\(A\)’ is for alternation, another name for logical disjunction. ‘\(E\)’ is for equivalence.)

In Polish notation, a binary connective is written before the two sentences that it connects. For example, the sentence \(A\) & \(B\) of SL would be written \(Kab\) in Polish notation.

The sentences ¬\(A\) → \(B\) and ¬(\(A\) → \(B\)) are very different; the main logical operator of the first is the conditional, but the main connective of the second is negation. In SL, we show this by putting parentheses around the conditional in the second sentence. In Polish notation, parentheses are never required. The left-most connective is always the main connective. The first sentence would simply be written \(CNab\) and the second \(NCab\).

This feature of Polish notation means that it is possible to evaluate sentences simply by working through the symbols from right to left. If you were constructing a truth table for \(NKab\), for example, you would first consider the truth-values assigned to \(b\) and \(a\), then consider their conjunction, and then negate the result. The general rule for what to evaluate next in SL is not nearly so simple. In SL, the truth table for ¬(\(A\) & \(B\)) requires looking at \(A\) and \(B\), then looking in the middle of the sentence at the conjunction, and then at the beginning of the sentence at the negation. Because the order of operations can be specified more mechanically in Polish notation, variants of Polish notation are used as the internal structure for many computer programming languages.