Hierarchies in Dependence Logic

Author:

Durand Arnaud1,Kontinen Juha2

Affiliation:

1. Université Paris Diderot

2. University of Helsinki

Abstract

We study fragments D ( k ∀) and D ( k -dep) of dependence logic defined either by restricting the number k of universal quantifiers or the width of dependence atoms in formulas. We find the sublogics of existential second-order logic corresponding to these fragments of dependence logic. We also show that, for any fixed signature, the fragments D ( k ∀) give rise to an infinite hierarchy with respect to expressive power. On the other hand, for the fragments D ( k -dep), a hierarchy theorem is otained only in the case the signature is also allowed to vary. For any fixed signature, this question is open and is related to the so-called Spectrum Arity Hierarchy Conjecture.

Funder

Suomen Akatemia

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science

Cited by 25 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Dimension in team semantics;Mathematical Structures in Computer Science;2024-03-12

2. On definability of team relations with k-invariant atoms;Annals of Pure and Applied Logic;2022-12

3. A parameterized view on the complexity of dependence and independence logic;Journal of Logic and Computation;2022-11-14

4. Tractability Frontier of Data Complexity in Team Semantics;ACM Transactions on Computational Logic;2022-01-31

5. A Parameterized View on the Complexity of Dependence Logic;Logical Foundations of Computer Science;2021-12-16

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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