In a previous paper [ 21 ] all extensions of Johansson’s minimal logic J with the weak interpolation property WIP were described. It was proved that WIP is decidable over J. It turned out that the weak interpolation problem in extensions of J is reducible to the same problem over a logic Gl, which arises from J by adding tertium non datur. In this paper we consider extensions of the logic Gl. We prove that only finitely many logics over Gl (...) have the Craig interpolation property CIP, the restricted interpolation property IPR or the projective Beth property PBP. The full list of Gl-logics with the mentioned properties is found, and their description is given. We note that IPR and PBP are equivalent over Gl. It is proved that CIP, IPR and PBP are decidable over the logic Gl. (shrink)