
We consider the state of elementary recursion theory when the familiar 0 , 1 , + , × , = , > 0, 1, +, \times , =, > of ordinary arithmetic are replaced by constants, functions, and relations from an arbitrary model.
computability, definability, pairing functions, computations on rings and fields, program language, Abstract and axiomatic computability and recursion theory, abstract recursion theory, computable functions
computability, definability, pairing functions, computations on rings and fields, program language, Abstract and axiomatic computability and recursion theory, abstract recursion theory, computable functions
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 11 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
