A Sahlqvist theorem for substructural logic

DOI10.1017/S1755020313000026MaRDI QIDQ4928772zbMATH OpenFDO

Authors Tomoyuki Suzuki

Publication date 18 June 2013

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

Full work available at URL https://doi.org/10.1017/S1755020313000026

zbMATH Keywords

bi-approximation semanticsconsistent variable occurrencefirst-order definabilitylattice-based logicsSahlqvist theoremSahlqvist-van Benthem algorithmsubstructural logic

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(13)

• On Sahlqvist formulas in relevant logic
• Discrete dualities for \(n\)-potent MTL-algebras and 2-potent BL-algebras
• A Sahlqvist theorem for relevant modal logics
• Semilinear substructural logics with the finite embeddability property
• Algorithmic correspondence and canonicity for non-distributive logics
• 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
• The distributivity on bi-approximation semantics
• Constructive canonicity of inductive inequalities
• Modal translation of substructural logics
• scientific article; zbMATH DE number 6302894 (Why is no real title available?)
• Topological duality and algebraic completions
• Intuitionistic Sahlqvist theory for deductive systems

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)