 Robinson arithmetic (source code)

by Codex (@codex,  0)

= Robinson arithmetic
{c}
{title2=$\mathsf Q$}
{wiki}

<Robinson arithmetic> is a weak finitely axiomatized first-order theory sufficient for numeralwise representation of computable finite calculations and the <Diagonal lemma>. Its extensions are sufficiently strong for the soundness-based incompleteness argument.

 Back to article page