The last question on recursively enumerable \(m\)-degrees (Q1908450)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The last question on recursively enumerable m-degrees |
scientific article; zbMATH DE number 848943
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The last question on recursively enumerable \(m\)-degrees |
scientific article; zbMATH DE number 848943 |
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
0.8359216451644897
0 references
0.7904890179634094
0 references
