Semantical analysis of predicate logics without the contraction rule
A semantics for some predicate logics without the contraction rule is introduced in this paper. Each structure in our semantics is a partially- ordered monoid which is also a complete meet-semilattice with a constant domain. By using the method developed by the author and \textit{Y. Komori} in J. Symb. Logic 50, 169-201 (1985; Zbl 0583.03018), the completeness theorem is proved. Then it is shown that the above semantics has a close connection with Beth semantics.
scientific article; zbMATH DE number 3957063