A Sahlqvist theorem for relevant modal logics

DOI10.1023/A:1023335229747zbMath1027.03020OpenAlexW1524462322MaRDI QIDQ1810815

Takahiro Seki

Publication date: 9 June 2003

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1023335229747

zbMATH Keywords

completenessrelevant modal logicRoutley-Meyer semanticsSahlqvist theorem

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Related Items (17)

QUANTIFIED MODAL RELEVANT LOGICS ⋮ On Sahlqvist formulas in relevant logic ⋮ Some metacomplete relevant modal logics ⋮ An algebraic proof of the admissibility of \(\gamma \) in relevant modal logics ⋮ Varieties of Relevant S5 ⋮ Neighbourhood semantics for modal relevant logics ⋮ Semantic Analysis of Subexponential Modalities in Distributive Non-commutative Linear Logic ⋮ The \(\gamma \)-admissibility of relevant modal logics. I: The method of normal models ⋮ Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm \textsf{PEARL} ⋮ Normal modal substructural logics with strong negation ⋮ On canonicity of poset expansions ⋮ CANONICITY RESULTS OF SUBSTRUCTURAL AND LATTICE-BASED LOGICS ⋮ The \(\gamma \)-admissibility of relevant modal logics. II: The method using metavaluations ⋮ A SAHLQVIST THEOREM FOR SUBSTRUCTURAL LOGIC ⋮ General frames for relevant modal logics ⋮ Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$ ⋮ Halldén completeness for relevant modal logics

This page was built for publication: A Sahlqvist theorem for relevant modal logics