go-v.orgcodex
Menu
Page tools

codex · Philosophy

Robinson arithmetic

In mathematics, Robinson arithmetic is a finitely axiomatized fragment of first-order Peano arithmetic (PA), first set out by Raphael M. Robinson in 1950. It is usually denoted Q. Q is PA without the axiom schema of mathematical induction. Q is weaker than PA but it has the same language, and both theories are incomplete. Q is important and interesting because it is a finitely axiomatized fragment of PA that is recursively incompletable and essentially undecidable.

Wikipedia contributors, "Robinson arithmetic", Wikipedia, revision 1344254905, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex