Definable operators on stable set lattices
From MaRDI portal
Abstract: A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have a relational semantics provided by structures based on polarities. Such structures have associated complete lattices of stable subsets, and these have been used to construct canonical extensions of lattice-based algebras. We study classes of structures that are closed under ultraproducts and whose stable set lattices have additional operators that are first-order definable in the underlying structure. We show that such classes generate varieties of algebras that are closed under canonical extensions. The proof makes use of a relationship between canonical extensions and MacNeille completions.
Recommendations
- Canonical extensions and ultraproducts of polarities
- Some characterization and preservation theorems in modal logic
- scientific article; zbMATH DE number 2070195
- Notes on modal definability
- Duality and canonical extensions of bounded distributive lattices with operators, and applications to the semantics of non-classical logics. I
Cites work
- Algorithmic correspondence and canonicity for non-distributive logics
- Boolean Algebras with Operators. Part I
- Bounded lattice expansions
- Canonical extensions and relational completeness of some substructural logics
- Canonical extensions and ultraproducts of polarities
- Categories: how I learned to stop worrying and love two sorts
- Generalized Kripke frames
- Generalized Kripke semantics for the Lambek-Grishin calculus
- scientific article; zbMATH DE number 3494368 (Why is no real title available?)
- scientific article; zbMATH DE number 194916 (Why is no real title available?)
- scientific article; zbMATH DE number 3103212 (Why is no real title available?)
- MacNeille completions and canonical extensions
- MacNeille completions of lattice expansions
- Modal logic
- Relational semantics for full linear logic
- Residuated lattices. An algebraic glimpse at substructural logics
- Varieties of complex algebras
Cited in
(2)
This page was built for publication: Definable operators on stable set lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2027212)