Helping and the meet of pairs of honest subrecursive classes

Axt, 1959, On a subrecursive hierarchy and primitive recursive degrees, Trans. Amer. Math. Soc., 92, 85, 10.1090/S0002-9947-1959-0126377-3 Lynch, 1972, Relativization of the Theory of Computational Complexity, Project MAC Tech. Report MAC TR-99 MacHtey, 1972, Augmented loop languages and classes of computable functions, J. Comp. Sys. Sci., 6, 603, 10.1016/S0022-0000(72)80032-1 MacHtey, 1974, The honest subrecursive classes are a lattice, Inform. Contr., 24, 247, 10.1016/S0019-9958(74)80039-2 MacHtey, 1975, On the density of honest subrecursive classes, J. Comput. System Sci., 10, 10.1016/S0022-0000(75)80039-0 Meyer, 1972, A classification of the recursive functions, Zeitschr. Math. Logik Grund. Math., 18, 71, 10.1002/malq.19720180405 Symes, 1971, The Extension of Machine-Independent Computational Complexity Theory to Oracle Computation and to the Computation of Finite Functions