Noun
Robinson arithmetic (uncountable)
(mathematics) A finitely axiomatized fragment of first-order Peano arithmetic, lacking the axiom schema of mathematical induction.
One sufficient collection is the set of theorems of Robinson arithmetic Q. Some systems, such as Peano arithmetic, can directly express statements about natural numbers. Source: Internet
There are systems, such as Robinson arithmetic, which are strong enough to meet the assumptions of the first incompleteness theorem, but which do not prove the Hilbert Bernays conditions. Source: Internet