A general method for proving decidability of intuitionistic modal logics-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A general method for proving decidability of intuitionistic modal logics

Published:2006-09 Issue:3 Volume:4 Page:219-230
ISSN:1570-8683
Container-title:Journal of Applied Logic
language:en
Short-container-title:Journal of Applied Logic

Author:

Alechina Natasha,Shkatov Dmitry

Publisher

Elsevier BV

Subject

Applied Mathematics,Logic

Reference36 articles.

1. Categorical and Kripke semantics for constructive modal logics;Alechina,2001

2. Modal languages and bounded fragments of predicate logic;Andréka;J. Philos. Logic,1998

3. Computational types from a logical perspective;Benton;J. Funct. Programming,1998

4. On an intuitionistic modal logic;Bierman;Studia Logica,2000

5. A modal extension of intuitionistic modal logic;Bull;Notre Dame J. Formal Logic,1965

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

1. Intuitionistic S4 is decidable;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

2. Complexity of finite-variable fragments of propositional temporal and modal logics of computation;Theoretical Computer Science;2022-08

3. Undecidability of QLTL and QCTL with two variables and one monadic predicate letter;Logical Investigations;2021-12-19

4. Complexity of finite-variable fragments of products with K;Journal of Logic and Computation;2020-10-22

5. Computational properties of the logic of partial quasiary predicates;Conference of the South African Institute of Computer Scientists and Information Technologists 2020;2020-09-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP