Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages
From MaRDI portal
Publication:3382820
Recommendations
- Algorithmic properties of first-order modal logics of the natural number line in restricted languages
- Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages
- Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages
- Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames
- scientific article; zbMATH DE number 2020143
Cited in
(10)- Complexity of finite-variable fragments of propositional temporal and modal logics of computation
- Computational complexity of theories of a binary predicate with a small number of variables
- Undecidability of QLTL and QCTL with two variables and one monadic predicate letter
- Algorithmic properties of first-order modal logics of the natural number line in restricted languages
- Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages
- Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино?
- Are bundles good deals for first-order modal logic?
- Algorithmic properties of modal and superintuitionistic logics of monadic predicates over finite Kripke frames
- Variations on the Kripke trick
- Non-axiomatizability of modal predicate logics of Dedekind-complete linear orders with constant domains
This page was built for publication: Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3382820)