Back and forth relations for reduced abelian p-groups Original Research Article

In order to apply known general theorems about the effective properties of recursive structures in a particular recursive structure, it is necessary to verify that certain decidability conditions are satisfied. This requires the determination of when certain relations, called back and forth relations, hold between finite strings of elements from the structure. Here we determine this for recursive reduced abelian p-groups, thus enabling us to apply these theorems.