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
Facts
5 properties- Instance of
- axiomatic system
- Defining formula
- \begin{align}&Sx\ne0\\&Sx=Sy\implies x=y\\&y=0\lor \exists x.(Sx=y)\\&x+0=x\\&x+Sy=S(x+y)\\&x\cdot0=0\\&x\cdot Sy=(x\cdot y)+x\end{align}[3]
- Does not have characteristic
- decidability[4]
- Named after
- Raphael M. Robinson[2]
🏷️ Also known as
en Robinson arithmetic
cs Robinsonova aritmetika
de Robinson-Arithmetik
fr arithmétique de Robinson
hu Robinson-aritmetika
id aritmetika Robinson
it aritmetica di Robinson
ja ロビンソン算術
ko 로빈슨 산술
nl Robinson-rekenkunde
pt aritmética de Robinson
ru арифметика Робинсон
sv Robinsonaritmetik
uk арифметика Робінсон
vi số học Robinson
zh 鲁宾逊算术
zh-hant 魯賓遜算術
🔖 Identifiers · 3
- Freebase ID
- /m/07m3f2
- Microsoft Academic ID (discontinued)
- 4962995
- NLab ID
- Robinson arithmetic
🔗 Connections
Created notable works 1
Does not have characteristic 1
Instance of 1
Named after 1
Press Enter · cited answer in seconds
0 sources
Summary
Robinson arithmetic is an axiomatic system[1].