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 extend 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's局部性定理推广到了所有具有幂等操作的半环,但对于许多非幂等半环则不适用。然后我们考虑Gaifman范式,并展示了对于自由变量公式以布尔半环以外的半环来讲,Gaifman的定理无法推广。对于句子,它在自然半环和热带半环中都会失败。然而,我们的主要结果是针对min-max和lattice半环的Gaifman范式的存在性建议。该证明暗示着布尔半环的Gaifman经典定理的更强版本:每个句子都具有不添加否定的Gaifman范式。