Relationships between classes of monotonic functions

Abstract

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 Scott concerning the power of his Logic for Computable Functions.