On deductive interpolation for the weak nilpotent minimum logic (Q1697356): Difference between revisions

This paper shows that the deductive interpolation property (DIP) holds for the weak nilpotent minimum logic (WNM) [\textit{F. Esteva} and \textit{L. Godo}, ibid. 124, 271--288 (2001; Zbl 0994.03017)], which is a substructural logic of the class of weak nilpotent minimum t-norms, i.e., monoidal operations over \([0, 1]^2\) of the form \[ x \star y = \begin{cases} 0 & x\leq \mathbf{n}(y) \\ \min(x, y) & x > \mathbf{n}(y) \end{cases} \] where \(\mathbf{n}: [0, 1] \to [0, 1]\) is an order-reversing mapping (weak negation), such that \(\mathbf{n}(0) = 1\), \(\mathbf{n}(1) = 0\) and \(x \leq \mathbf{n}(\mathbf{n}(x))\) for all \(x \in [0, 1]\). The author shows, using the model theoretic approach of quantifier elimination, that the corresponding variety of algebras has the amalgamation property. As follows from results of [\textit{H. Kibara} and \textit{H. Ono}, J. Log. Comput. 20, 823--875 (2010; Zbl 1207.03030)], that the DIP then holds for WNM.