Semantic interpolation

The problem of interpolation is a classical problem in logic. Given a consequence relation ̃ and two formulas φ and with ψ ̃ we try to find a "simple" formula ψ such that φ ̃ ψ ̃. "Simple" is defined here as "expressed in the common language of φ and &psiⁿ ". Non-monotonic logics like preferential logics are often a mixture of a non-monotonic part with classical logic. In such cases, it is natural examine also variants of the interpolation problem, like: is there "simple" α such that φ ψ ̃, where is classical consequence? We translate the interpolation problem from the syntactic level to the semantic level. For example, the classical interpolation problem is now the question whether there is some "simple" model set X such that M(φ) X M(ψ). We can show that such X always exist for monotonic and antitonic logics. The case of non-monotonic logics is more complicated, there are several variants to consider, and we mostly have only partial results.