Complete,Recursively Enumerable Relations in Arithmetic

Using only propositional connectives and the provability predicate of a Σ₁-sound theory T containing Peano Arithmetic we define recursively enumerable relations that are complete for specific natural classes of relations, as the class of all r. e. relations, and the class of all strict partial orders. We apply these results to give representations of these classes in T by means of formulas.