The last question on recursively enumerable \(m\)-degrees (Q1908450): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q162063 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Zheng, Xizhong / rank | |||
Normal rank | |||
Revision as of 19:29, 9 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The last question on recursively enumerable \(m\)-degrees |
scientific article |
Statements
The last question on recursively enumerable \(m\)-degrees (English)
0 references
19 March 1996
0 references
This paper shows that true arithmetic can be interpreted in the elementary theory of \(R_m\), the structure of r.e. \(m\)-degrees. Hence, the theory of r.e. \(m\)-degrees has the same computational complexity as true first-order arithmetic. Furthermore, it is proved that a standard model of arithmetic can be defined in \(R_m\) without parameters.
0 references
recursively enumerable \(m\)-degrees
0 references
computational complexity
0 references
first-order arithmetic
0 references
