Modal logic with relations over paths: a theoretical development through comonadic semantics
From MaRDI portal
Cites work
- A categorical account of composition methods in logic
- A note on graded modal logic
- A pebbling comonad for finite rank and variable logic, and an application to the equirank-variable homomorphism preservation theorem
- A sequent calculus for a modal logic on finite data trees
- Arboreal categories and equi-resource homomorphism preservation theorems
- Arboreal Categories: An Axiomatic Theory of Resources
- Bisimulations on Data Graphs
- Comonadic semantics for guarded fragments
- Comonadic semantics for hybrid logic
- Counting bounded tree depth homomorphisms
- scientific article; zbMATH DE number 692330 (Why is no real title available?)
- Modal logic
- Model theory of XPath on data trees. I: Bisimulation and characterization
- Monads need not be endofunctors
- On recognizing graphs by numbers of homomorphisms
- Operations with structures
- Relating structure and power: Comonadic semantics for computational resources
- Resource bisimilarity and graded bisimilarity coincide
- Structure and Power: an Emerging Landscape
- The expressive power of memory logics
- The formal theory of monads
- The pebbling comonad in finite model theory
- Two-variable logic on data trees and XML reasoning
This page was built for publication: Modal logic with relations over paths: a theoretical development through comonadic semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6923517)
