scientific article
From MaRDI portal
Publication:3509049
zbMath1148.03012MaRDI QIDQ3509049
L.A.Chagrova, Alexander Chagrov
Publication date: 1 July 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
undecidabilitymodal logicKripke framesfirst-order definabilitycorrespondence theorymodal definabilityalgorithmic problems
Modal logic (including the logic of norms) (03B45) Undecidability and degrees of sets of sentences (03D35)
Related Items (9)
Algebraic modal correspondence: Sahlqvist and beyond ⋮ Boolean logics with relations ⋮ Definability in the class of all -frames – computability and complexity ⋮ Algorithmic correspondence and canonicity for distributive modal logic ⋮ The Ackermann approach for modal logic, correspondence theory and second-order reduction ⋮ Modal definability of first-order formulas with free variables and query answering ⋮ A dichotomy for some elementarily generated modal logics ⋮ Algorithmic correspondence and canonicity for non-distributive logics ⋮ KRIPKE COMPLETENESS OF STRICTLY POSITIVE MODAL LOGICS OVER MEET-SEMILATTICES WITH OPERATORS
This page was built for publication:
