
The aim of this work is to axiomatize and enhance the recursion theory on monotonic hierarchies of operative spaces developed in [1]. This is to be accomplished by employing a special new variety of operative spaces called Platek spaces. The original structure studied by Platek in [2] corresponds to the particular Platek space with structural class O=ω and a bottom operative space consisting of single-valued partial functions over an arbitrary domain (Example 1.1 below). We believe that Platek spaces not only redefine Platek's approach in an abstract manner, but also provide the appropriate setting for an intrinsic Generalized Recursion Theory.
computability, combinatory algebra, Platek spaces, lightface recursion, recursion theory on monotonic hierarchies of operative spaces, generalized recursion theory, Abstract and axiomatic computability and recursion theory
computability, combinatory algebra, Platek spaces, lightface recursion, recursion theory on monotonic hierarchies of operative spaces, generalized recursion theory, Abstract and axiomatic computability and recursion theory
| 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). | 0 | |
| 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). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
