Robinson arithmetic
Finitely axiomatized fragment of first-order Peano arithmetic that is recursively incompletable (in the sense of Gödel’s incompleteness theorems) and essentially undecidable
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.
Nº Q928884 ★
Common · Knowledge
Robinson arithmetic
Finitely axiomatized fragment of first-order Peano arithmetic that is recursively incompletable (in the sense of Gödel’s incompleteness theorems) and essentially undecidable
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.
From Wikipedia
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.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
Abraham Robinson
American mathematician (1918–1974)
Nº Q330567 ★
Not listed
-
L
Löb's theorem
Theorem
Nº Q204884 ★
Not listed
-
Theorem of Wantzel
Nº Q3527176 ★
Not listed
-
Frege's theorem
Metatheorem that states that the Peano axioms of arithmetic can be derived in second-order logic from Hume's principle
Nº Q1052005 ★
Not listed
-
P
Presburger arithmetic
First-order theory of the natural numbers with addition
Nº Q956059 ★
Not listed
-
R
Rodrigues' formula
Formula for the Legendre polynomials
Nº Q4491933 ★
Not listed