Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages
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 …
and arity of predicate letters, in languages of first-order predicate modal logics of finite …
Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages
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 …
number and arity of predicate letters, in languages of first-order predicate superintuitionistic …
Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages
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 …
some related logics, in languages with restrictions on the number of individual variables as …
Predicate counterparts of modal logics of provability: High undecidability and Kripke incompleteness
M Rybakov - Logic Journal of the IGPL, 2024 - academic.oup.com
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 …
means of Kripke frames, of the modal propositional logics,, and their extensions are …
Complexity of finite-variable fragments of products with K
We show that products and expanding relativized products of propositional modal logics
where one component is the minimal monomodal logic K are polynomial-time reducible to …
where one component is the minimal monomodal logic K are polynomial-time reducible to …
Complexity of finite-variable fragments of products with non-transitive modal logics
We show that products of propositional modal logics where at least one factor is one of the
monomodal logics,, and are polynomial-time embeddable into their single-variable …
monomodal logics,, and are polynomial-time embeddable into their single-variable …
[PDF][PDF] Algorithmic Properties of First-Order Modal Logics of the Natural Number Line in Restricted Languages.
MN Rybakov, D Shkatov, N Olivetti, R Verbrugge… - AiML, 2020 - philarchive.org
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 …
and (N,≤) in languages with restrictions on the number of individual variables as well as the …
Complexity of finite-variable fragments of propositional temporal and modal logics of computation
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 …
embeddable into their single-variable fragments. It follows that satisfiability for CTL and CT …
[PDF][PDF] Undecidability of QLTL and QCTL with two variables and one monadic predicate letter
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 …
QCTL in languages with restrictions on the number of individual variables as well as the …
On complexity of propositional linear-time temporal logic with finitely many variables
It is known [4] that both satisfiability and model-checking problems for propositional Linear-
time Temporal Logic, LTL, with only a single propositional variable in the language are …
time Temporal Logic, LTL, with only a single propositional variable in the language are …