A SAHLQVIST THEOREM FOR SUBSTRUCTURAL LOGIC
From MaRDI portal
Publication:4928772
DOI10.1017/S1755020313000026zbMath1282.03014MaRDI QIDQ4928772
Publication date: 18 June 2013
Published in: The Review of Symbolic Logic (Search for Journal in Brave)
substructural logicfirst-order definabilitylattice-based logicsSahlqvist theorembi-approximation semanticsconsistent variable occurrenceSahlqvist-van Benthem algorithm
Related Items
The distributivity on bi-approximation semantics ⋮ On Sahlqvist formulas in relevant logic ⋮ Topological duality and algebraic completions ⋮ Discrete dualities for \(n\)-potent MTL-algebras and 2-potent BL-algebras ⋮ Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm \textsf{PEARL} ⋮ Algorithmic correspondence and canonicity for non-distributive logics ⋮ Modal translation of substructural logics ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Algorithmic correspondence and canonicity for distributive modal logic
- A Sahlqvist theorem for distributive modal logic
- Generalized Kripke frames
- Residuated lattices. An algebraic glimpse at substructural logics
- Stone duality for lattices
- Sahlqvist's theorem for Boolean algebras with operators with an application to cylindric algebras
- Constructive canonicity in non-classical logics
- Duality for lattice-ordered algebras and for normal algebraizable logics
- Semantic analysis of orthologic
- Trends in logic. 50 years of Studia Logica
- A Sahlqvist theorem for relevant modal logics
- Elementary canonical formulae: extending Sahlqvist's theorem
- CANONICITY RESULTS OF SUBSTRUCTURAL AND LATTICE-BASED LOGICS
- Kripke models for linear logic
- A completeness theorem in modal logic
- A new proof of Sahlqvist's theorem on modal definability and completeness
