EXPSPACE-Completeness of the Logics K4 × S5 and S4 × S5 and the Logic of Subset Spaces
-
Published:2021-10-31
Issue:4
Volume:22
Page:1-71
-
ISSN:1529-3785
-
Container-title:ACM Transactions on Computational Logic
-
language:en
-
Short-container-title:ACM Trans. Comput. Logic
Author:
Hertling Peter1ORCID,
Krommes Gisela1
Affiliation:
1. Fakultät für Informatik, Universität der Bundeswehr München, Neubiberg, Germany
Abstract
It is known that the satisfiability problems of the product logics K4 × S5 and S4 × S5 are NEXPTIME-hard and that the satisfiability problem of the logic SSL of subset spaces is PSPACE-hard. Furthermore, it is known that the satisfiability problems of these logics are in N2EXPTIME. We improve the lower and the upper bounds for the complexity of these problems by showing that all three problems are in ESPACE and are EXPSPACE-complete under logspace reduction.
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Reference34 articles.
1. Alternation
2. Domino-tiling games;Chlebus Bogdan S.;J. Comput. System Sci.,1986