论文标题
强烈的一阶，域独立依赖性：联盟链接的案例
Strongly First Order, Domain Independent Dependencies: the Union-Closed Case
论文作者
论文摘要
团队语义是通过定义对作业集的满意度而不是对单个作业的满意度来概括Tarski的语义。因此，可以使用团队语义通过新型的连接剂或原子来扩展一阶逻辑 - 最重要的是，通过在不同作业之间表达依赖性的依赖性原子。 这些扩展中的一些比一阶逻辑更具表现力，而另一些则可以还原。在这项工作中，我为独立领域的依赖性原子提供了必要和足够的条件（从某种意义上说，关系中的真理或虚假性并不取决于在关系中不发生的要素模型中的存在）并关闭联盟（在某种意义上，每当有一个与人的关系所满足的情况下，它不再满足其阶段，以使其逐渐达到一定的阶段，这是因为它的一流秩序，而这是一定的阶段，而这是一定的阶段，而这是一个阶段的阶段，那么它的阶段就可以在阶段上获得。比一阶逻辑本身。
Team Semantics generalizes Tarski's Semantics by defining satisfaction with respect to sets of assignments rather than with respect to single assignments. Because of this, it is possible to use Team Semantics to extend First Order Logic via new kinds of connectives or atoms - most importantly, via dependency atoms that express dependencies between different assignments. Some of these extensions are more expressive than First Order Logic proper, while others are reducible to it. In this work, I provide necessary and sufficient conditions for a dependency atom that is domain independent (in the sense that its truth or falsity in a relation does not depend on the existence in the model of elements that do not occur in the relation) and union closed (in the sense that whenever it is satisfied by all members of a family of relations it is also satisfied by their union) to be strongly first order, in the sense that the logic obtained by adding them to First Order Logic is no more expressive than First Order Logic itself.
