Modal characterisation theorems over special classes of frames
From MaRDI portal
Publication:732052
DOI10.1016/j.apal.2009.04.002zbMath1185.03027OpenAlexW2029611280WikidataQ58215565 ScholiaQ58215565MaRDI QIDQ732052
Publication date: 9 October 2009
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2009.04.002
Modal logic (including the logic of norms) (03B45) Model theory of finite structures (03C13) Interpolation, preservation, definability (03C40)
Related Items (21)
Some modal aspects of XPath ⋮ The monadic theory of finite representations of infinite words ⋮ ON MODAL μ-CALCULUS OVER FINITE GRAPHS WITH SMALL COMPONENTS OR SMALL TREE WIDTH ⋮ The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs ⋮ A sound and complete axiomatization for Dynamic Topological Logic ⋮ A general Lindström theorem for some normal modal logics ⋮ Model theory of XPath on data trees. II: Binary bisimulation and definability ⋮ On the \(\mu \)-calculus over transitive and finite transitive frames ⋮ COMPLETE INTUITIONISTIC TEMPORAL LOGICS FOR TOPOLOGICAL DYNAMICS ⋮ Complexity of hybrid logics over transitive frames ⋮ The finite model property for logics with the tangle modality ⋮ Unnamed Item ⋮ Characterization, definability and separation via saturated models ⋮ The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity ⋮ A quantified coalgebraic van Benthem theorem ⋮ Spatial logic of tangled closure operators and modal mu-calculus ⋮ Non-finite axiomatizability of dynamic topological logic ⋮ Modal characterisation theorems over special classes of frames ⋮ On the modal definability of simulability by finite transitive models ⋮ Tangled modal logic for topological dynamics ⋮ INQUISITIVE BISIMULATION
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modal characterisation theorems over special classes of frames
- Modal languages and bounded fragments of predicate logic
- Modal logic over finite structures
- Modal and guarded characterisation theorems over finite transition systems
- Some modal aspects of XPath
- The modalμ-calculus hierarchy over restricted classes of transition systems
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
This page was built for publication: Modal characterisation theorems over special classes of frames