An atomic formula or its negation, commonly used as the basic unit in clause-based representations and satisfiability procedures.

Principle

A literal is the smallest signed propositional unit: either an atom (positive literal) or the negation of an atom (negative literal); clauses are built as disjunctions of literals and many inference rules operate at the literal level.

Demonstration

Given atom p, the two literals are p and ¬p; in first-order logic, P(x) and ¬P(a) are literals where P is a predicate symbol and x or a are terms.

Misapplication

Treating compound formulas such as (p ∧ q) or quantified formulas as literals misuses the term and breaks clause-based algorithms that assume literals are atomic or negated-atomic.

Consequence

Correct identification of literals enables clause representation, unit propagation, resolution steps, and efficient indexing; many SAT and theorem-proving optimizations rely on literal-level operations.

Reversal

Instead of decomposing to signed atoms, consider aggregating literals into complex subformulas—this reverses the atomic viewpoint and shifts work from literal-level inference to higher-level structural reasoning.

Boundary

A literal must be an atom or its explicit negation; it excludes Boolean combinations (conjunctions, disjunctions) unless those combinations are themselves treated as atoms by encoding, and equality may or may not be an atomic predicate depending on the formalism.

Semantic Tension

Literal vs atom vs signed literal: 'atom' denotes the unsigned atomic formula, 'literal' typically implies the signed form; some texts use 'signed literal' to emphasize polarity explicitly.

Synthesis

A literal is the atomic proposition or its negation serving as the basic signed unit in clause-based formalisms; it supports polarity-aware inferences used by SAT solvers and resolution calculi.