# Literal (mathematical logic)

Jump to navigation Jump to search

In mathematical logic, a literal is an atomic formula (atom) or its negation. The definition mostly appears in proof theory (of classical logic), e.g. in conjunctive normal form and the method of resolution.

Literals can be divided into two types:

• A positive literal is just an atom.
• A negative literal is the negation of an atom.

For a literal $l$ , the complementary literal is a literal corresponding to the negation of $l$ , we can write ${\bar {l}}$ to denote the complementary literal of $l$ . More precisely, if $l\equiv x$ then ${\bar {l}}$ is $\lnot x$ and if $l\equiv \lnot x$ then ${\bar {l}}$ is $x$ .

In the context of a formula in the conjunctive normal form, a literal is pure if the literal's complement does not appear in the formula.

In Boolean functions, the variables that appear either in complemented or uncompleted form is a literal. For example, if $A$ , $B$ and $C$ are variables then the expressions ${\bar {A}}BC$ contains three literal and ${\bar {A}}C+{\bar {B}}{\bar {C}}$ contains three literals.

## Examples

In propositional calculus a literal is simply a propositional variable or its negation.

In predicate calculus a literal is an atomic formula or its negation, where an atomic formula is a predicate symbol applied to some terms, $P(t_{1},\ldots ,t_{n})$ with the terms recursively defined starting from constant symbols, variable symbols, and function symbols. For example, $\neg Q(f(g(x),y,2),x)$ is a negative literal with the constant symbol 2, the variable symbols x, y, the function symbols f, g, and the predicate symbol Q.