A quantified coalgebraic van Benthem theorem
From MaRDI portal
Publication:2233433
Cites work
- scientific article; zbMATH DE number 1104375 (Why is no real title available?)
- scientific article; zbMATH DE number 195102 (Why is no real title available?)
- scientific article; zbMATH DE number 1852922 (Why is no real title available?)
- scientific article; zbMATH DE number 822489 (Why is no real title available?)
- scientific article; zbMATH DE number 7559483 (Why is no real title available?)
- (Metric) bisimulation games and real-valued modal logics for coalgebras
- A Subdirect-Union Representation for Completely Distributive Complete Lattices
- A Van Benthem Theorem for Modal Team Semantics
- A behavioural pseudometric for probabilistic transition systems
- A general theory of structure spaces with applications to spaces of prime ideals
- A van Benthem theorem for fuzzy modal logic
- A van Benthem/Rosen theorem for coalgebraic predicate logic
- Algebraic laws for nondeterminism and concurrency
- An analysis of first-order logics of probability
- Approximation in quantale-enriched categories
- Automata for the modal \(\mu \)-calculus and related results
- Automata, Languages and Programming
- Bisimulation for labelled Markov processes
- Bisimulation through probabilistic testing
- CONCUR 2005 – Concurrency Theory
- Coalgebraic behavioral metrics
- Coalgebraic logic for stochastic right coalgebras
- Coalgebraic predicate logic
- Completely Distributive Complete Lattices
- Continuity spaces: Reconciling domains and metric spaces
- Expressive logics for coalgebras via terminal sequence induction
- Expressivity of coalgebraic modal logic: the limits and beyond
- First-order expressivity for S5-models: Modal vs. two-sorted languages
- First-order fuzzy logic
- Generalized Bisimulation Metrics
- Metrics for labelled Markov processes
- Modal characterisation theorems over special classes of frames
- Modal logic over finite structures
- Model theory of XPath on data trees. I: Bisimulation and characterization
- Model theory of XPath on data trees. II: Binary bisimulation and definability
- Monadic second-order logic and bisimulation invariance for coalgebras
- Neighbourhood Structures: Bisimilarity and Basic Model Theory
- Notions of bisimulation for Heyting-valued modal languages
- Notions of conformance testing for cyber-physical systems: overview and roadmap (invited paper)
- PDL is the bisimulation-invariant fragment of weak chain logic
- Probabilistic metric spaces as enriched categories
- Quantales and continuity spaces
- Quantitative Behavioural Reasoning for Higher-order Effectful Programs
- Relation lifting, with an application to the many-valued cover modality
- Some modal aspects of XPath
- Terminal coalgebras in well-founded set theory
- The quantitative linear-time-branching-time spectrum
- Topological theories and closed objects
- Universal coalgebra: A theory of systems
Cited in
(3)
This page was built for publication: A quantified coalgebraic van Benthem theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233433)
