A weakly definable type which is not definable (Q1313603)

The notion of a weakly definable type, a generalization of the fundamental notion of a definable type (which goes back to Gaifman's seminal work on models of PA) was first introduced and investigated in the context of models of arithmetic by \textit{L. A. S. Kirby} [Ann. Pure Appl. Logic 27, 215-252 (1984; Zbl 0565.03014)] and was further studied in a more general setting by \textit{L. A. S. Kirby} and \textit{A. Pillay} [Trans. Am. Math. Soc. 295, 547-563 (1986; Zbl 0626.03024)]. Ironically, one nagging question remained unsolved: Is there a weakly definable type which is not definable? In the paper under review, the author uses a clever combinatorial construction based on the notion of an independent family to construct a type which is weakly definable but not definable.