(1) Department of Mathematics and Statistics, McGill University, 805 Sherbrooke St. W, Montreal, P.Q. H3A 2K6, Canada;(2) Department of Mathematics and Statistics, University of Ottawa, Ottawa, Ontario K1N 6N5, Canada
Abstract:
We study the monoid of primitive recursive functions and investigate a onestep construction of a kind of exact completion, which resembles that of the familiar category of modest sets, except that the partial equivalence relations which serve as objects are recursively enumerable. As usual, these constructions involve the splitting of symmetric idempotents.
