On representation of sequential and parallel functions
The class of monotonic (in the sense of Scott ) functions is divided into subclasses of sequential and parallel ones and the problem of comparative power of different sequential and parallel functions with respect to composition (theorems 1–5) and recursion (theorem 6) is then investigated. In particular, theorem 6 answers the question of D.Scott  concerning the power of his Logic for Computable Functions.
Unable to display preview. Download preview PDF.
- 2.Sazonov, V.Ju., On expressibility and computability of objects in Scott's ICF. In Proceedings of the Third All-Union Conference on Mathematical Logic, pp. 191–194, Novosibirsk, 1974 (in Russian).Google Scholar
- 3.Scott, D., Outline of a mathematical theory of computation. Technical Monograph PRG-2, Oxford University, Oxford, 1970.Google Scholar
- 4.Scott., D., A type-theoretical alternative to CUCH, ISWIM, OWHY (unpublished). Oxford, 1969.Google Scholar
- 5.Trakhtenbrot, M.B., On interpretated functions in program schemata. In System and Theoretical Programming, (V.E.Kotov, Ed.), pp. 188–211, Novosibirsk, 1973 (in Russian).Google Scholar
- 6.Vuillemin, J., Proof techniques for recursive programs. Ph. D. Thesis, Computer Science Department, Stanford University, Stanford, 1973.Google Scholar