The area of symbolic logic called propositional logic, originally called propositional calculus but not to be confused with the school subject calculus, studies the properties of sentences formed from constants, usually designated A, B, C, ... and five logical operators, AND, OR, IMPLIES, EQUALS and NOT. The corresponding logical operations are known, respectively, as conjunction, disjunction, material conditional, biconditional, and negation. These five operators are sometimes denoted as keywords, especially in computer languages, and sometimes by special symbols (see Table of logic symbols). All except NOT are binary operators; NOT is a unary operator which precedes its operand. The values of these operators are given by truth tables.
Predicate logic, originally called predicate calculus, expands on propositional logic by the introduction of variables, usually denoted by x, y, z, or other lowercase letters, and also by the introduction of sentences containing variables, called predicates, usually denoted by an uppercase letter followed by a list of variables, such as P(x) or Q(y,z). In addition, predicate logic allows so-called quantifiers, representing ALL and EXISTS.