arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2102.10368cs.LOmath.LO
收藏

依赖与独立的逻辑:局部变式

Logics of Dependence and Independence: The Local Variants

Erich Grädel, Phil Pützstück

摘要:

现代的依赖和独立逻辑是基于团队语义的,这意味着公式的计算不是基于变量的单个赋值,而是基于一组这样的赋值,称为团队。这导致了存在二阶逻辑水平上的高表达能力。作为替代,Baltag和van Benthem提出了依赖逻辑的局部变体,称为函数依赖逻辑(logic of functional dependence,LFD)。虽然它的语义也是基于团队的,但公式只在其中一个分配上进行本地评估,并且团队只是作为评估过程中考虑的可能分配的供应。因此,这种逻辑依赖于广义赋值语义的模态视角,并且可以被看作是一阶逻辑的一个片段。对于不含等式的LFD变体,可满足性问题是可判定的。我们扩展了本地化逻辑的依赖和独立的想法,在一个系统的方式,考虑到本地变量的标准原子依赖属性:除了依赖和独立,还包括,排除和匿名。我们研究模型理论和算法问题的本地化逻辑,并解决了一些问题,已离开开放的巴尔塔格和范Benthem。特别地,我们研究了局部逻辑的可判定性问题,证明了等式可满足的LFD是不可判定的。此外,我们通过适当的互模拟的概念建立特征定理,并研究这些逻辑的模型检验问题的复杂性。

英文摘要:

Modern logics of dependence and independence are based on team semantics, which means that formulae are evaluated not on a single assignment of values to variables, but on a set of such assignments, called a team. This leads to high expressive power, on the level of existential second-order logic. As an alternative, Baltag and van Benthem have proposed a local variant of dependence logic, called logic of functional dependence (LFD). While its semantics is also based on a team, the formulae are evaluated locally on just one of its assignments, and the team just serves as the supply of the possible assignments that are taken into account in the evaluation process. This logic thus relies on the modal perspective of generalized assignments semantics, and can be seen as a fragment of first-order logic. For the variant of LFD without equality, the satisfiability problem is decidable. We extend the idea of localising logics of dependence and independence in a systematic way, taking into account local variants of standard atomic dependency properties: besides dependence and independence, also inclusion, exclusion, and anonymity. We study model-theoretic and algorithmic questions of the localised logics, and also resolve some of the questions that had been left open by Baltag and van Benthem. In particular, we study decidability issues of the local logics, and prove that satisfiability of LFD with equality is undecidable. Further, we establish characterisation theorems via appropriate notions of bisimulation and study the complexity of model checking problems for these logics.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑