Semiring semantics of first-order logic generalises classical Boolean semantics by permitting truth values from a commutative semiring, which can model information such as costs or access restrictions. This raises the question to what extent classical model theoretic properties still apply, and how this depends on the algebraic properties of the semiring. In this paper, we study this question for the classical locality theorems due to Hanf and Gaifman. We prove that Hanf's Locality Theorem generalises to all semirings with idempotent operations, but fails for many non-idempotent semirings. We then consider Gaifman normal forms and show that for formulae with free variables, Gaifman's Theorem does not generalise beyond the Boolean semiring. Also for sentences, it fails in the natural semiring and the tropical semiring. Our main result, however, is a constructive proof of the existence of Gaifman normal forms for min-max and lattice semirings. The proof implies a stronger version of Gaifman's classical theorem in Boolean semantics: every sentence has a Gaifman normal form which does not add negations.
翻译:第一阶逻辑的半环语义通过允许来自交换半环的真值来推广经典布尔语义,因此可以模拟成本或访问限制等信息。这引出了经典模型论性质是否仍然适用的问题,以及这取决于半环的代数属性。在本文中,我们研究了经典的Hanf和Gaifman的局部性定理与此问题的关系。我们证明了Hanf的局部性定理对于所有带幂等操作的半环都是可以推广的,但它在许多非幂等半环中会失败。接着,我们考虑Gaifman正常形式,并且指出对于带自由变量的公式,Gaifman的定理在布尔半环之外无法推广。对于语句,它在自然半环和热带半环中也失败了。然而,我们的主要结果是能够构造性地证明min-max半环和格半环存在Gaifman正常形式。该证明意味着布尔语义下Gaifman的经典定理有一个更强的版本:每个语句都有一个不添加否定的Gaifman正常形式。