Game comonads \& generalised quantifiers

DOI10.46298/LMCS-20(3:8)2024MaRDI QIDQ6597958FDOQ6597958

Anuj Dawar, Adam Ó Conghaile

Publication date: 4 September 2024

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

zbMATH Keywords

finite model theorylogicgeneralised quantifiersgame comonads

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Elements of finite model theory.
• Definability hierarchies of generalized quantifiers
• Generalized quantifiers and pebble games on finite structures
• The expressive power of finitely many generalized quantifiers
• Generalized Quantifiers and Logical Reducibilities
• Infinitary logic and inductive definability over finite structures
• Logical hierarchies in PTIME
• Infinitary logic for computer science
• Relating Structure and Power: Comonadic Semantics for Computational Resources
• Pebble Games with Algebraic Rules
• Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
• RANK LOGIC IS DEAD, LONG LIVE RANK LOGIC!

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 Q6597958)