A survey on temporal logics for specifying and verifying real-time systems

S Konur - Frontiers of Computer Science, 2013 - Springer
Over the last two decades, there has been an extensive study of logical formalisms on
specifying and verifying real-time systems. Temporal logics have been an important …

Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages

M Rybakov, D Shkatov - Journal of Logic and Computation, 2020 - academic.oup.com
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 …

Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages

M Rybakov, D Shkatov - Journal of Logic and Computation, 2021 - academic.oup.com
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 …

Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages

M Rybakov, D Shkatov - Journal of Logic and Computation, 2021 - academic.oup.com
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 …

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 …

Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter

M Rybakov, D Shkatov - Studia Logica, 2019 - Springer
We prove that the positive fragment of first-order intuitionistic logic in the language with two
individual variables and a single monadic predicate letter, without functional symbols …

Complexity of finite-variable fragments of propositional modal logics of symmetric frames

M Rybakov, D Shkatov - Logic Journal of the IGPL, 2019 - academic.oup.com
While finite-variable fragments of the propositional modal logic S5—complete with respect to
reflexive, symmetric and transitive frames—are polynomial-time decidable, the restriction to …

Complexity of finite-variable fragments of products with K

M Rybakov, D Shkatov - Journal of Logic and Computation, 2021 - academic.oup.com
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 …

Complexity of finite-variable fragments of products with non-transitive modal logics

M Rybakov, D Shkatov - Journal of Logic and Computation, 2022 - academic.oup.com
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 …

[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 …