R

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 ★

Común · Saberes

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

Texto en inglés

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.

En Wikipedia

Texto en inglés Aún no hay artículo en tu idioma: extracto en inglés.

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.

Texto: Wikipedia en inglés, CC BY-SA 4.0. ·

Cartas cercanas

Abrir

…

Confirmación