We treat ordinary recursion theory and one of its natural generalizations to arbitrary structures, search computability; and we treat hyperarithmetic theory and one of its abstractions to arbitrary structures, hyperelementary theory. Both are dealt with simultaneously using generalized elementary formal systems which are simple axiomatic systems of derivation, and which can be thought of as being rules for the generation of a set or relation.