The Downward Transfer of Elementary Satisfiability of Partition Logics
Enshao Shen, Yijia Chen · Mathematical logic quarterly · 2000
We introduce a notion of pseudo-reachability in Gaifman graphs and suggest a graph-theoretic and uniform approach to the Löwenheim-Skolem-Tarski Theorems for partition logics as well as logics with general Malitz quantifiers.