Axiomatic recursion theory and the continuous functionals
Copyright policy )Axiomatic recursion theory and the continuous functionals
AbstractWe define, in the spirit of Fenstad [2], a higher type computation theory, and show that countable recursion over the continuous functionals forms such a theory. We also discuss Hyland's proposal from [4] for a scheme with which to supplement S1–S9, and show that this augmented set of schemes fails to generate countable recursion. We make another proposal to which the methods of this section do not apply.
- University of Kent United Kingdom
Higher-type and set recursion theory, Kleene computations, higher type computation theory, countable recursion, Abstract and axiomatic computability and recursion theory
Higher-type and set recursion theory, Kleene computations, higher type computation theory, countable recursion, 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).1 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
Citations provided by BIP!Popularity provided by BIP!