The pebble-relation comonad in finite model theory
From MaRDI portal
Publication:6563056
DOI10.46298/LMCS-20(2:9)2024MaRDI QIDQ6563056
Author name not available (Why is that?), Nihil Shah
Publication date: 27 June 2024
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Elements of finite model theory.
- Graph minors. I. Excluding a forest
- Upper and lower bounds for first order expressibility
- Logical hierarchies in PTIME
- A pebbling comonad for finite rank and variable logic, and an application to the equirank-variable homomorphism preservation theorem
- Every two elementarily equivalent models have isomorphic ultrapowers
- On constraint satisfaction problems below P
- On recognizing graphs by numbers of homomorphisms
- Lov\'asz Meets Weisfeiler and Leman
- Relating Structure and Power: Comonadic Semantics for Computational Resources
- Counting Bounded Tree Depth Homomorphisms
- Relating structure and power: Comonadic semantics for computational resources
- Monads need not be endofunctors
- Linear Datalog and Bounded Path Duality of Relational Structures
- Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
- Operations with structures
- Homomorphism tensors and linear equations
Related Items (2)
Lasserre hierarchy for graph isomorphism and homomorphism indistinguishability ⋮ Logical equivalences, homomorphism indistinguishability, and forbidden minors
This page was built for publication: The pebble-relation comonad in finite model theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563056)
