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

DOI10.1093/logcom/exaa091zbMath1477.03028OpenAlexW3121437634MaRDI QIDQ5858132

Mikhail Rybakov, Dmitry Shkatov

Publication date: 9 April 2021

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exaa091

zbMATH Keywords

predicate logicsuperintuitionistic logicsfinite Kripke frames

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (4)

Undecidability of QLTL and QCTL with two variables and one monadic predicate letter ⋮ Complexity of finite-variable fragments of propositional temporal and modal logics of computation ⋮ Computational complexity of the word problem in modal and Heyting algebras with a small number of generators ⋮ Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино?

This page was built for publication: Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages