paper

Robinson consistency in many-sorted hybrid first-order logics

arXiv:2208.08708

Abstract

In this paper we prove a Robinson consistency theorem for a class of many-sorted hybrid logics as a consequence of an Omitting Types Theorem. An important corollary of this result is an interpolation theorem.

Robinson consistency in many-sorted hybrid first-order logics · wovepaper