Game comonads \& generalised quantifiers

DOI10.4230/LIPICS.CSL.2021.16MaRDI QIDQ6839820zbMATH OpenFDO

Authors Adam Ó Conghaile, Anuj Dawar

Publication date 23 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.CSL.2021.16

zbMATH Keywords

finite model theorygame comonadsgeneralised quantifierslogic

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• A comonadic view of simulation and quantum resources
• Approximations of isomorphism and logics with linear-algebraic operators
• Definability hierarchies of generalized quantifiers
• Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
• Elements of finite model theory.
• Generalized Quantifiers and Logical Reducibilities
• Generalized quantifiers and pebble games on finite structures
• scientific article; zbMATH DE number 6003856 (Why is no real title available?)
• scientific article; zbMATH DE number 1324669 (Why is no real title available?)
• Infinitary logic and inductive definability over finite structures
• Infinitary logic for computer science
• Logical hierarchies in PTIME
• Pebble games with algebraic rules
• Rank logic is dead, long live rank logic!
• Relating structure and power: comonadic semantics for computational resources
• The expressive power of finitely many generalized quantifiers
• The pebbling comonad in finite model theory
• The quantum monad on relational structures

Cited in

(3)

• Limitations of game comonads for invertible-map equivalence via homomorphism indistinguishability
• A categorical account of composition methods in logic
• Arboreal categories and resources

This page was built for publication: Game comonads \& generalised quantifiers

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