scientific article; zbMATH DE number 1749143
A class \(K\) of models is called globally definable iff it is the model class of a set \(\Phi\) of modal formulas with respect to validity in models. In this way the usual notion of (local) definability is `globalized', which is defined with respect to pointed models. The authors present, in particular, global versions of the Goldblatt-Thomason Theorem and van Benthem's Bisimulation Theorem, respectively. I.e., both a characterization theorem for globally definable classes and a determination of the first-order formulas globally equivalent to some modal formula is provided [see, e.g., \textit{P. Blackburn, M. de Rijke} and \textit{Y. Venema}: Modal logic, Cambridge: Cambridge Univ. Press (2001; Zbl 0988.03006)]. Moreover, corresponding characterization results and some corollaries on preservation of modal formulas are presented for model classes globally definable by universal and positive formulas, respectively. For the entire collection see [Zbl 0982.00038].
- Elementary definability and completeness in general and positive modal logic
- Elementary classes in basic modal logic
- Modal logic via global consequence
- Model theory of XPath on data trees. II: Binary bisimulation and definability
- Characterization, definability and separation via saturated models
- Modal definability based on Łukasiewicz validity relations
- On characterization, definability and -saturated models
- Local Goldblatt-Thomason theorem
- A generalization of modal frame definability
- Towards a generalization of modal definability
- One modal logic to rule them all?
- Existential definability of modal frame classes
- 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 Q4532129)