A recent article of G. Chang shows that an n × n partial latin square with prescribed diagonal can always be embedded in an n × n latin square except in one obvious case where it cannot be done. Chang's proof is to show that the symbols of the partial latin square can be assigned the elements of the additive abelian group Zn so that the diagonal elements of the square sum to zero. A theorem of M. Halls then shows this to be embeddable in the operation table of the group. In this paper, we show that when n is a prime one can determine exactly the number of distinct ways in which this assignment can be made. The proof uses some graph theoretic techniques.

For Γ a revursively enumerable set of formulae, a structure U on a recursive universe is said to be “Γ-recursively enumerable” if the satisfaction predicate restricted to Γ is recursively enumerable (equivalently, if the formulae of Γ uniformulae of Γ uniformly denote recursively enumerable relations on U).

For recursively enumerable sets Γ1 ⊆ Γ2 of formulae we shall, under certain conditions, characterize structures U with the following properties.

1) Every isomorphism form U to a Γ1-recursively enumerable structure is a recursive isomorphism.

2) Every Γ1-recursively enumerable structure isomorphic to U is recursively isomorphic to U.

3) Every Γ1-recursively enumerable structure isomorphic to U is Γ2-recursively enumerable.