Logics of dependence and independence: The local variants

Author:

Grädel Erich1,Pützstück Phil1

Affiliation:

1. Mathematical Foundations of Computer Science, RWTH Aachen University, D-52056 Aachen, Germany

Abstract

Abstract 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 ($ {\textsf {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 $ {\textsf {LFD}}$ without equality, the satisfiability problem is decidable. We extend the idea of localizing 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 localized 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 $ {\textsf {LFD}}$ with equality is undecidable. Further, we establish characterization theorems via appropriate notions of bisimulation and study the complexity of model checking problems for these logics.

Publisher

Oxford University Press (OUP)

Subject

Logic,Hardware and Architecture,Arts and Humanities (miscellaneous),Software,Theoretical Computer Science

Reference20 articles.

1. Modal languages and bounded fragments of predicate logic;Andréka;Journal of Philosophical Logic,1998

2. Structural Complexity II

3. A simple logic of functional dependence;Baltag;Journal of Philosopical Logic,2021

4. Games and model checking for guarded logics;Berwanger,2001

5. Modal Logic

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3