Repository | Book | Chapter
(1987) Mathematical logic and its applications, Dordrecht, Springer.
There are two different classical concepts of relative effective computability in Ordinary Recursion Theory (cf. [5,7]), namely µ-recursiveness and partial recursiveness. The latter can be described either (i) as µ-recursiveness in a certain multiple-valued function, say U = λs.{2s, 2S+1}, or (ii) as existentially quantified primitive recursiveness.
Publication details
DOI: 10.1007/978-1-4613-0897-3_18
Full citation:
Ivanov, L. L. (1987)., Distributive spaces, in D. G. Skordev (ed.), Mathematical logic and its applications, Dordrecht, Springer, pp. 265-272.
This document is unfortunately not available for download at the moment.