Abstract:
In this paper, we present proofs of properties of semirecursive sets based directly on the definition of these sets and on the recursiveness of Kleene predicates. These proofs are shorter and clearer than traditional proofs of similar statements for recursively enumerable sets.