We study the effect of restricting the number of individual variables, as well as the number
and arity of predicate letters, in languages of first-order predicate modal logics of finite …

We consider the effect of restricting the number of individual variables, as well as the
number and arity of predicate letters, in languages of first-order predicate superintuitionistic …

We study the algorithmic properties of first-order monomodal logics of frames,,,,,, as well as
some related logics, in languages with restrictions on the number of individual variables as …

In this paper, the predicate counterparts, defined both axiomatically and semantically by
means of Kripke frames, of the modal propositional logics,, and their extensions are …

We study algorithmic properties of first-order predicate monomodal logics of the frames (N,<)
and (N,≤) in languages with restrictions on the number of individual variables as well as the …

We prove that branching-time temporal logics CTL and CT L⁎ are polynomial-time
embeddable into their single-variable fragments. It follows that satisfiability for CTL and CT …

We study the algorithmic properties of the quantified (first-order) temporal logics QLTL and
QCTL in languages with restrictions on the number of individual variables as well as the …

We obtain an effective embedding of the classical predicate logic into the logic of partial
quasiary predicates. The embedding has the property that an image of a non-theorem of the …

arXiv:2307.02800v1 [math.LO] 6 Jul 2023 Algorithmic properties of QK4.3 and QS4.3 Page 1
arXiv:2307.02800v1 [math.LO] 6 Jul 2023 Algorithmic properties of QK4.3 and QS4.3 M …

We study the algorithmic properties of the quantified linear-time temporal logic QLTL in
languages with restrictions on the number of individual variables as well as the number and …