Relating structure and power: comonadic semantics for computational resources

DOI10.4230/LIPICS.CSL.2018.2MaRDI QIDQ5079721zbMATH OpenOpenAlexFDO

Authors Samson Abramsky, Nihil Shah

Publication date 28 May 2022

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

zbMATH Keywords

finite model theorycombinatorial gamesbisimulationcomonadspebble gamescoKleisli categoryEhrenfeucht-Fraissé gamescoalgebras of a comonad

Mathematics Subject Classification ID

Logic in computer science (03B70)

Recommendations

• Relating structure and power: Comonadic semantics for computational resources
• Relating structure and power: comonadic semantics for computational resources (extended abstract)
• The pebbling comonad in finite model theory
• A Theory for Game Theories
• A convenient category for games and interaction

Cites work

• scientific article; zbMATH DE number 3688686 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 3549200 (Why is no real title available?)
• scientific article; zbMATH DE number 1324669 (Why is no real title available?)
• scientific article; zbMATH DE number 1341606 (Why is no real title available?)
• scientific article; zbMATH DE number 1500662 (Why is no real title available?)
• scientific article; zbMATH DE number 2117181 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• A calculus of communicating systems
• A note on graded modal logic
• Combining effects and coeffects via grading
• Comonadic notions of computation
• Computational Semantics with Functional Programming, by Jan van Eijck and Christina Unger .
• Dependence logic. A new approach to independence friendly logic
• Elements of finite model theory.
• Every two elementarily equivalent models have isomorphic ultrapowers
• Infinitary logics and 0-1 laws
• Logical hierarchies in PTIME
• Modal languages and bounded fragments of predicate logic
• Modal logic
• Notions of computation and monads
• On elementary equivalence for equality-free logic
• Resource bisimilarity and graded bisimilarity coincide
• The freedoms of (guarded) bisimulation
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• The pebbling comonad in finite model theory
• The quantum monad on relational structures
• Tree-depth, subgraph coloring and homomorphism bounds
• Treewidth. Computations and approximations

Cited in

(15)

• Polyadic sets and homomorphism counting
• Comonadic semantics for guarded fragments
• The pebbling comonad in finite model theory
• Monadic monadic second order logic
• Structure in machine learning
• Stone duality for relations
• Structure and Power: an Emerging Landscape
• The pebble-relation comonad in finite model theory
• Game comonads \& generalised quantifiers
• Relating structure and power: comonadic semantics for computational resources (extended abstract)
• The pebble-relation comonad in finite model theory
• Relating structure and power: Comonadic semantics for computational resources
• Arboreal categories and equi-resource homomorphism preservation theorems
• Arboreal Categories: An Axiomatic Theory of Resources
• A Cook's tour of duality in logic: from quantifiers, through Vietoris, to measures

This page was built for publication: Relating structure and power: comonadic semantics for computational resources

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5079721)