A Sahlqvist theorem for substructural logic

DOI10.1017/S1755020313000026zbMATH Open1282.03014MaRDI QIDQ4928772FDOQ4928772

Authors: Tomoyuki Suzuki 

Publication date: 18 June 2013

Published in: The Review of Symbolic Logic (Search for Journal in Brave)

Recommendations

• On Sahlqvist formulas in relevant logic
• A new proof of Sahlqvist's theorem on modal definability and completeness
• scientific article; zbMATH DE number 1543335
• Herbrand theorems for substructural logics
• Theorem provers for substructural logics

zbMATH Keywords

substructural logicfirst-order definabilitylattice-based logicsSahlqvist theorembi-approximation semanticsconsistent variable occurrenceSahlqvist-van Benthem algorithm

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Cites Work

• Stone duality for lattices
• Kripke models for linear logic
• A completeness theorem in modal logic
• Residuated lattices. An algebraic glimpse at substructural logics
• Generalized Kripke frames
• Constructive canonicity in non-classical logics
• Duality for lattice-ordered algebras and for normal algebraizable logics
• Semantic analysis of orthologic
• Canonicity results of substructural and lattice-based logics
• A Sahlqvist theorem for relevant modal logics
• Algorithmic correspondence and canonicity for distributive modal logic
• Elementary canonical formulae: extending Sahlqvist's theorem
• A Sahlqvist theorem for distributive modal logic
• A new proof of Sahlqvist's theorem on modal definability and completeness
• Sahlqvist's theorem for Boolean algebras with operators with an application to cylindric algebras
• Title not available (Why is that?)
• Trends in logic. 50 years of Studia Logica

Cited In (12)

• Title not available (Why is that?)
• Semilinear substructural logics with the finite embeddability property
• A Sahlqvist theorem for relevant modal logics
• The distributivity on bi-approximation semantics
• Modal translation of substructural logics
• On Sahlqvist formulas in relevant logic
• 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}
• Bi-approximation semantics for substructural logic at work
• Title not available (Why is that?)
• Algorithmic correspondence and canonicity for non-distributive logics
• Topological duality and algebraic completions

This page was built for publication: A Sahlqvist theorem for substructural logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928772)