There is a well-established correspondence between interpolation and amalgamation for algebraizable logics that satisfy certain additional assumptions. In this paper, we introduce the Robinson property of a logic and show that a conditionally algebraizable logic without any additional assumptions has the Robinson property if and only if the corresponding class of Lindenbaum–Tarski algebras has the amalgamation property. Moreover, we give the logical characterization of the strong amalgamation property, solving an open problem of Andréka–Németi–Sain. It is also shown that given the (...) mentioned extra assumptions the Robinson property implies the interpolation property. As conditionally algebraizable logics cover algebraizable logics as well as various quantifier logics such as classical first order logic, our results yield a generalization of some of the results concerning interpolation and amalgamation. (shrink)

In this paper we introduce the modelwise interpolation property of a logic that states that whenever \(\models\phi\to\psi\) holds for two formulas \(\phi\) and \(\psi\), then for every model \(\mathfrak{M}\) there is an interpolant formula \(\chi\) formulated in the intersection of the vocabularies of \(\phi\) and \(\psi\), such that \(\mathfrak{M}\models\phi\to\chi\) and \(\mathfrak{M}\models\chi\to\psi\), that is, the interpolant formula in Craig interpolation may vary from model to model. We compare the modelwise interpolation property with the standard Craig interpolation and with the local interpolation (...) property by discussing examples, most notably the finite variable fragments of first order logic, and difference logic. As an application we connect the modelwise interpolation property with the local Beth definability, and we prove that the modelwise interpolation property of an algebraizable logic can be characterized by a weak form of the superamalgamation property of the class of algebras corresponding to the models of the logic. (shrink)