Algorithmic aspects of propositional tense logics-Reference-Cited by-同舟云学术

Algorithmic aspects of propositional tense logics

Published:1995 Issue: Volume: Page:442-455
ISSN:0302-9743
Container-title:Computer Science Logic
language:
Short-container-title:

Author:

Chagrov Alexander V.,Shehtman Valentin B.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0022274

Reference14 articles.

1. BAKER K.A. Finite equational bases for finite algebras in a congruence distributive equational classes. Adv. Math., 1977, v.24, 207–243.

2. BREDIKHIN D.M. Representation of ordered involuted semigroups. Izvestija vuzov, matematika, 1975, No.7, 119–129 (in Russian).

3. CHAGROV A.V. Undecidable properties of extensions of provability logic. I: Algebra i Logika, 1990, v.29, No.3, 350–367; II: ibid., No.5, 613–623. (In Russian)

4. CHAGROV A.V., ZAKHARYASCHEV M.V. The undecidability of the disjunction property of propositional logics and other related problems. J. of Symb. Logic, 1993, v.58, No.3, 967–1002.

5. GOLDBLATT R. Logic of time and computation. CSLI Lecture Notes No.7, 1987.

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

1. TABULARITY AND POST-COMPLETENESS IN TENSE LOGIC;The Review of Symbolic Logic;2022-04-07

2. KRIPKE COMPLETENESS OF STRICTLY POSITIVE MODAL LOGICS OVER MEET-SEMILATTICES WITH OPERATORS;The Journal of Symbolic Logic;2019-04-03

3. A Note on Strictly Positive Logics and Word Rewriting Systems;Larisa Maksimova on Implication, Interpolation, and Definability;2018

4. Bisimulation games and locally tabular logics;Russian Mathematical Surveys;2016-10-31

5. Deciding Regular Grammar Logics with Converse Through First-Order Logic;Journal of Logic, Language and Information;2005-06