It allows sequences of symbols to be represented as single natural numbers.

It was originally developed to simplify prime factorization problems.

It is used only in number theory and has no role in logic.

It assigns a unique natural number to each symbol in a formal language.

Polynomial-time reduction.

Encoding the computation of a nondeterministic Turing machine as a Boolean formula.

Boolean formula representations.

Diagonalization principle.

MPCP reduces to PCP.

MPCP is decidable.

The first tile must be used as the starting tile.

MPCP is equivalent to Context-Free Grammars.

Polynomial-time reduction.

Encoding the computation of a nondeterministic Turing machine as a Boolean formula.

Boolean formula representations.

Diagonalization principle.