Recursiveness and $R^c$-operations

Relations are established characterizing the connection between recursiveness with respect to consistent functionals and $R^c$-operations known in the theory of sets. It is pointed out that the graph of a functional that is partial recursive with respect to a given consistent functional $F$ can be obtained by a certain (appropriate to $F$) $R^c$-operation. Sets obtained by a given $R^c$-operation over general recursive sets are characterized as semirecursive with respect to a certain (appropriate to this $R^c$-operation) consistent functional.