First-order definability in modal logic
From MaRDI portal
Cites work
Cited in
(12)- Modal languages for topology: expressivity and definability
- Mathematical modal logic: A view of its evolution
- On Sahlqvist formulas in relevant logic
- Factor varieties
- Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames
- Elementary canonical formulae: extending Sahlqvist's theorem
- Expressivity of second order propositional modal logic
- Varieties of complex algebras
- The Modal Formula (†) \square \diamondsuit p \supset \square \diamondsuit \square \diamondsuit p Is Not First-Order Definable
- Decidable and Undecidable Problems for First-Order Definability and Modal Definability
- A framework for the transfer of proofs, lemmas and strategies from classical to non classical logics
- The McKinsey axiom on weakly transitive frames
This page was built for publication: First-order definability in modal logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4068700)