Modal characterisation theorems over special classes of frames
From MaRDI portal
Recommendations
- Bisimulation invariance and finite models
- Modal and guarded characterisation theorems over finite transition systems
- Bisimulation invariant monadic-second order logic in the finite
- Bisimulation Invariant Monadic-Second Order Logic in the Finite
- A Note on Bisimulation Quantifiers and Fixed Points over Transitive Frames
Cites work
- scientific article; zbMATH DE number 3819693 (Why is no real title available?)
- scientific article; zbMATH DE number 3708351 (Why is no real title available?)
- scientific article; zbMATH DE number 1324669 (Why is no real title available?)
- scientific article; zbMATH DE number 612169 (Why is no real title available?)
- Modal and guarded characterisation theorems over finite transition systems
- Modal characterisation theorems over special classes of frames
- Modal languages and bounded fragments of predicate logic
- Modal logic
- Modal logic over finite structures
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
- Some modal aspects of XPath
- The modal \(\mu \)-calculus hierarchy over restricted classes of transition systems
Cited in
(33)- A quantified coalgebraic van Benthem theorem
- Complexity of hybrid logics over transitive frames
- Semantical characterizations for irreflexive and generalized modal languages
- A Note on Bisimulation Quantifiers and Fixed Points over Transitive Frames
- Complete intuitionistic temporal logics for topological dynamics
- Modal and guarded characterisation theorems over finite transition systems
- A model-theoretic approach to descriptive general frames: the van Benthem characterization theorem
- On modal \(\mu \)-calculus over finite graphs with small components or small tree width
- The finite model property for logics with the tangle modality
- scientific article; zbMATH DE number 440120 (Why is no real title available?)
- The freedoms of (guarded) bisimulation
- Model theory of XPath on data trees. II: Binary bisimulation and definability
- Bisimulation in inquisitive modal logic
- A general Lindström theorem for some normal modal logics
- A sound and complete axiomatization for dynamic topological logic
- On the modal definability of simulability by finite transitive models
- Tangled modal logic for topological dynamics
- scientific article; zbMATH DE number 7267340 (Why is no real title available?)
- Bisimulation invariance and finite models
- Modal characterisation theorems over special classes of frames
- Characterization, definability and separation via saturated models
- Spatial logic of tangled closure operators and modal mu-calculus
- On expressive power of basic modal intuitionistic logic as a fragment of classical FOL
- On the \(\mu \)-calculus over transitive and finite transitive frames
- Some modal aspects of XPath
- INQUISITIVE BISIMULATION
- Modal frame characterization by way of auxiliary modalities
- The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs
- The monadic theory of finite representations of infinite words
- On generalized van Benthem-type characterizations
- The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity
- Model theoretic methods for fragments of FO and special classes of (finite) structures
- Basic logic, K4, and persistence
This page was built for publication: Modal characterisation theorems over special classes of frames
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732052)