Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of
  Subset Spaces, Part 2: EXPSPACE-Hardness   It is known that the satisfiability problems of the product logics K4xS5 and
S4xS5 are NEXPTIME-hard and that the satisfiability problem of the logic SSL of
subset spaces is PSPACE-hard. We improve these lower bounds for the complexity
of these problems by showing that all three problems are EXPSPACE-hard under
logspace reduction. In another paper we show that these problems are in ESPACE.
This shows that all three problems are EXPSPACE-complete.

37
The categories of this paper are: supr-con
4
The categories of this paper are: cond-mat
16
The categories of this paper are: stat
18
The categories of this paper are: econ
7
The categories of this paper are: hep-th
0
The categories of this paper are: hep-ph
8
The categories of this paper are: hep-ex
33
The categories of this paper are: plasm-ph
19
The categories of this paper are: eess
14
The categories of this paper are: math-ph
10
The categories of this paper are: q-bio
6
The categories of this paper are: astro-ph
29
The categories of this paper are: funct-an
15
The categories of this paper are: nucl-ex
31
The categories of this paper are: ao-sci
23
The categories of this paper are: solv-int