Complexity and expressivity of propositional dynamic logics with finitely many variables

Author:

Rybakov Mikhail12,Shkatov Dmitry2

Affiliation:

1. Department of Mathematics, Tver State University, Russia

2. School of Computer Science and Applied Mathematics, University of the Witwatersrand, Johannesburg, South Africa

Funder

Russian Foundation for Basic Research

Publisher

Oxford University Press (OUP)

Subject

Logic

Reference22 articles.

1. A modal perspective on path constraints;Alechina;Journal of Logic and Computaion,2003

2. P. Balbiani and T.Tinchev. Definability and computability for PRSPDL. In Advances in Modal Logic, vol. 10, pp. 16–33, 2014.

3. A modal perspective on the computational complexity of attribute value grammar;Blackburn;Journal of Logic, Language, and Information,1993

4. How many variables does one need to prove PSPACE-hardness of modal logics?;Chagrov,2003

5. DAL—a logic for data analysis;del Cerro;Theoretical Computer Science,1985

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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