Relating Structure and Power: Comonadic Semantics for Computational Resources

DOI10.4230/LIPIcs.CSL.2018.2OpenAlexW2910759226MaRDI QIDQ5079721

Nihil Shah, Samson Abramsky

Publication date: 28 May 2022

Full work available at URL: https://dx.doi.org/10.4230/LIPIcs.CSL.2018.2

zbMATH Keywords

comonadsbisimulationcombinatorial gamesfinite model theorypebble gamesEhrenfeucht-Fraissé gamescoKleisli categorycoalgebras of a comonad

Mathematics Subject Classification ID

Logic in computer science (03B70)

Related Items (5)

Structure and Power: an Emerging Landscape ⋮ Arboreal categories and equi-resource homomorphism preservation theorems ⋮ Arboreal Categories: An Axiomatic Theory of Resources ⋮ Relating structure and power: comonadic semantics for computational resources (extended abstract) ⋮ Polyadic sets and homomorphism counting

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Elements of finite model theory.
• Notions of computation and monads
• A calculus of communicating systems
• Infinitary logics and 0-1 laws
• Modal languages and bounded fragments of predicate logic
• Treewidth. Computations and approximations
• On elementary equivalence for equality-free logic
• Logical hierarchies in PTIME
• Resource bisimilarity and graded bisimilarity coincide
• A note on graded modal logic
• Tree-depth, subgraph coloring and homomorphism bounds
• Every two elementarily equivalent models have isomorphic ultrapowers
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Comonadic Notions of Computation
• Computational Semantics with Functional Programming, by Jan van Eijck and Christina Unger .
• Combining effects and coeffects via grading
• The Freedoms of (Guarded) Bisimulation

This page was built for publication: Relating Structure and Power: Comonadic Semantics for Computational Resources