Abstract

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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call