A quantified coalgebraic van Benthem theorem
From MaRDI portal
Publication:2233433
DOI10.1007/978-3-030-71995-1_28OpenAlexW3137024392MaRDI QIDQ2233433
Publication date: 18 October 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-71995-1_28
Related Items
Kantorovich functors and characteristic logics for behavioural distances, A point-free perspective on lax extensions and predicate liftings, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation in quantale-enriched categories
- Expressive logics for coalgebras via terminal sequence induction
- Metrics for labelled Markov processes
- Probabilistic metric spaces as enriched categories
- Modal characterisation theorems over special classes of frames
- An analysis of first-order logics of probability
- Coalgebraic logic for stochastic right coalgebras
- First-order fuzzy logic
- Bisimulation through probabilistic testing
- A general theory of structure spaces with applications to spaces of prime ideals
- Quantales and continuity spaces
- Modal logic over finite structures
- Continuity spaces: Reconciling domains and metric spaces
- Universal coalgebra: A theory of systems
- A behavioural pseudometric for probabilistic transition systems
- Terminal coalgebras in well-founded set theory
- Topological theories and closed objects
- Model theory of XPath on data trees. II: Binary bisimulation and definability
- Expressivity of coalgebraic modal logic: the limits and beyond
- Bisimulation for labelled Markov processes
- Relation lifting, with an application to the many-valued cover modality
- Notions of Bisimulation for Heyting-Valued Modal Languages
- Some modal aspects of XPath
- Model Theory of XPath on Data Trees. Part I: Bisimulation and Characterization
- A Van Benthem/Rosen theorem for coalgebraic predicate logic
- Coalgebraic Predicate Logic
- Generalized Bisimulation Metrics
- Automata for the modal μ-calculus and related results
- Neighbourhood Structures: Bisimilarity and Basic Model Theory
- Algebraic laws for nondeterminism and concurrency
- PDL Is the Bisimulation-Invariant Fragment of Weak Chain Logic
- Monadic Second-Order Logic and Bisimulation Invariance for Coalgebras
- (Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras
- Quantitative Behavioural Reasoning for Higher-order Effectful Programs
- A van Benthem Theorem for Fuzzy Modal Logic
- A Van Benthem Theorem for Modal Team Semantics
- Automata, Languages and Programming
- Completely Distributive Complete Lattices
- A Subdirect-Union Representation for Completely Distributive Complete Lattices
- CONCUR 2005 – Concurrency Theory
- First-order expressivity for S5-models: Modal vs. two-sorted languages
