Robinson arithmetic
E1090019
UNEXPLORED
Robinson arithmetic is a weak formal system of arithmetic that captures basic properties of the natural numbers but is strictly weaker and less expressive than full Peano arithmetic.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Robinson arithmetic canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T14265196 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Robinson arithmetic Context triple: [Peano arithmetic, isStrongerThan, Robinson arithmetic]
-
A.
Peano arithmetic
Peano arithmetic is a formal first-order axiomatic system that captures the basic properties of the natural numbers and underpins much of modern mathematical logic and number theory.
-
B.
Skolem arithmetic
Skolem arithmetic is a fragment of first-order arithmetic focusing on the natural numbers with multiplication but without addition, studied for its distinctive decidability and model-theoretic properties.
-
C.
Lectures on the Logic of Arithmetic
Lectures on the Logic of Arithmetic is an educational work by Mary Everest Boole that explores the foundations and teaching of arithmetic through logical and psychological principles.
-
D.
Tarski–Mostowski–Robinson theorem
The Tarski–Mostowski–Robinson theorem is a fundamental result in model theory that characterizes when a class of structures is first-order axiomatizable, linking definability properties with closure under ultraproducts and isomorphisms.
-
E.
arithmetization of syntax
Arithmetization of syntax is a method in mathematical logic that encodes formal language expressions and proofs as natural numbers so that syntactic properties can be studied using arithmetic.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Robinson arithmetic Target entity description: Robinson arithmetic is a weak formal system of arithmetic that captures basic properties of the natural numbers but is strictly weaker and less expressive than full Peano arithmetic.
-
A.
Peano arithmetic
Peano arithmetic is a formal first-order axiomatic system that captures the basic properties of the natural numbers and underpins much of modern mathematical logic and number theory.
-
B.
Skolem arithmetic
Skolem arithmetic is a fragment of first-order arithmetic focusing on the natural numbers with multiplication but without addition, studied for its distinctive decidability and model-theoretic properties.
-
C.
Lectures on the Logic of Arithmetic
Lectures on the Logic of Arithmetic is an educational work by Mary Everest Boole that explores the foundations and teaching of arithmetic through logical and psychological principles.
-
D.
Tarski–Mostowski–Robinson theorem
The Tarski–Mostowski–Robinson theorem is a fundamental result in model theory that characterizes when a class of structures is first-order axiomatizable, linking definability properties with closure under ultraproducts and isomorphisms.
-
E.
arithmetization of syntax
Arithmetization of syntax is a method in mathematical logic that encodes formal language expressions and proofs as natural numbers so that syntactic properties can be studied using arithmetic.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.