scientific article; zbMATH DE number 3494368
From MaRDI portal
Publication:4075436
Cited in
(32)- Topology and duality in modal logic
- On the canonicity of Sahlqvist identities
- The structure of lattices of subframe logics
- Canonicity for intensional logics without iterative axioms
- Mathematical modal logic: A view of its evolution
- Lewis meets Brouwer: constructive strict implication
- Canonical extensions and ultraproducts of polarities
- Toward an infinitary logic of domains: Abramsky logic for transition systems
- A simple incomplete extension of T which is the union of two complete modal logics with f. m. p
- Elementary generation and canonicity for varieties of Boolean algebras with operators
- Correspondence, canonicity, and model theory for monotonic modal logics
- Definable operators on stable set lattices
- Saturated Kripke structures as Vietoris coalgebras
- Bisimulation and bisimilarity for fuzzy description logics under the Gödel semantics
- Algorithmic correspondence and canonicity for non-distributive logics
- On final coalgebras of power-set functors and saturated trees
- Deciding regular grammar logics with converse through first-order logic
- Varieties of complex algebras
- A road to ultrafilter extensions
- Separation logics and modalities: a survey
- Properties of Tense Logics
- A model-theoretic characterization of monadic second order logic on infinite words
- Logical characterizations of fuzzy bisimulations in fuzzy modal logics over residuated lattices
- Decidability of modal logics of non-\(k\)-colorable graphs
- Topological duality and algebraic completions
- Canonicity in power and modal logics of finite achronal width
- `Reflections on filtration': a response to `Modern faces of filtration' by Johan van Benthem and Nick Bezhanishvili
- Kripke completeness of infinitary predicate multimodal logics
- Approximate Hennessy-Milner type theorems for fuzzy multimodal logics over Heyting algebras
- Kripke-completeness and sequent calculus for quasi-Boolean modal logic
- Some characterization and preservation theorems in modal logic
- Ultrafilter extensions of bounded graphs are elementary
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4075436)
