2019
DOI: 10.1007/978-3-030-19570-0_48
|View full text |Cite
|
Sign up to set email alerts
|

Computational Complexity of Core Fragments of Modal Logics T, K4, and S4

Abstract: We show that the satisfiability problem in core fragments of modal logics T, K4, and S4 in whose languages diamond modal operators are disallowed is NL-complete. Moreover, we provide deterministic procedures for satisfiability checking. We show that the above fragments correspond to certain core fragments of linear temporal logic, hence our results imply NL-completeness of the latter.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
references
References 11 publications
0
0
0
Order By: Relevance