Switch to: References

Citations of:

Logic of Visibility, Perception, and Knowledge and Admissible Inference Rules

M. Golovanov, A. Kosheleva & V. Rybakov

Logic Journal of the IGPL 13 (2):201-209 (2005)

Add citations

You must login to add citations.

Discrete linear temporal logic with current time point clusters, deciding algorithms.V. Rybakov - 2008 - Logic and Logical Philosophy 17 (1-2):143-161.details The paper studies the logic TL(NBox+-wC) – logic of discrete linear time with current time point clusters. Its language uses modalities Diamond+ (possible in future) and Diamond- (possible in past) and special temporal operations, – Box+w (weakly necessary in future) and Box-w (weakly necessary in past). We proceed by developing an algorithm recognizing theorems of TL(NBox+-wC), so we prove that TL(NBox+-wC) is decidable. The algorithm is based on reduction of formulas to inference rules and converting the rules in special reduced (...) Download Export citation Bookmark
Logics with the universal modality and admissible consecutions.Rybakov Vladimir - 2007 - Journal of Applied Non-Classical Logics 17 (3):383-396.details In this paper1 we study admissible consecutions in multi-modal logics with the universal modality. We consider extensions of multi-modal logic S4n augmented with the universal modality. Admissible consecutions form the largest class of rules, under which a logic is closed. We propose an approach based on the context effective finite model property. Theorem 7, the main result of the paper, gives sufficient conditions for decidability of admissible consecutions in our logics. This theorem also provides an explicit algorithm for recognizing such (...) Download Export citation Bookmark 5 citations

1