Finite satisfiability of the two-variable guarded fragment with transitive guards and related variants

E Kieroński, L Tendera - ACM Transactions on Computational Logic …, 2018 - dl.acm.org
We consider extensions of the two-variable guarded fragment, GF2, where distinguished
binary predicates that occur only in guards are required to be interpreted in a special way …

Elementary modal logics over transitive structures

J Michaliszyn, J Otop - 2013 - research-explorer.ista.ac.at
We show that modal logic over universally first-order definable classes of transitive frames is
decidable. More precisely, let K be an arbitrary class of transitive Kripke frames definable by …

Finite model reasoning in expressive fragments of first-order logic

L Tendera - arXiv preprint arXiv:1703.02194, 2017 - arxiv.org
Over the past two decades several fragments of first-order logic have been identified and
shown to have good computational and algorithmic properties, to a great extent as a result of …

Satisfiability versus Finite Satisfiability in Elementary Modal Logics

J Michaliszyn, J Otop, P Witkowski - Fundamenta Informaticae, 2018 - content.iospress.com
We study variants of the satisfiability problem of elementary modal logics, ie, modal logic
considered over first-order definable classes of frames. The standard semantics of modal …

[PDF][PDF] Elementary Modal Logics–Decidability and Complexity

J Michaliszyn, J Otop, E Kieronski - ii.uni.wroc.pl
Modal logic was first introduced by philosophers to study the deductive behaviour of the
expressions it is necessary that and it is possible that. Nowadays, it is widely used in several …