Finite forcing and generic filters in arithmetic

We introduce the notions of forcing with respect to recursive function and recursive sets and forcing with respect to partial recursive function and r.e. sets. It is shown that the generic models are the same in both cases and coincide with the finitely generic model for a natural modification of arithmetic. This gives rise to a very interesting class of models which is investigated using the different ways in which it was obtained.