Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On complexity of propositional Linear-time Temporal Logic with finitely
  many variables   It is known [DemriSchnoebelen02] that both satisfiability and model-checking
problems for propositional Linear-time Temporal Logic, LTL, with only a single
propositional variable in the language are PSPACE-complete, which coincides
with the complexity of these problems for LTL with an arbitrary number of
propositional variables [SislaClarke85]. In the present paper, we show that the
same result can be obtained by modifying the original proof of SPACE-hardness
for LTL from [SislaClarke85]; i.e., we show how to modify the construction from
[SislaClarke85] to model the computations of polynomially-space bound Turing
machines using only formulas of one variable. We believe that our alternative
proof of the results from [DemriSchnoebelen02] gives additional insight into
the semantic and computational properties of LTL.

26
The categories of this paper are: bayes-an
24
The categories of this paper are: dg-ga
2
The categories of this paper are: math
34
The categories of this paper are: chem-ph
16
The categories of this paper are: stat
22
The categories of this paper are: chao-dyn
20
The categories of this paper are: acc-phys
19
The categories of this paper are: eess
37
The categories of this paper are: supr-con
9
The categories of this paper are: nlin
5
The categories of this paper are: gr-qc
10
The categories of this paper are: q-bio
23
The categories of this paper are: solv-int
21
The categories of this paper are: adap-org
28
The categories of this paper are: alg-geom
29
The categories of this paper are: funct-an