Generalizes the finite length property to structures with few-orbit finite approximations (char 0) and to Fraïssé limits with free amalgamation in unary/binary vocabularies, including the Rado graph.
The pebble-relation comonad in finite model theory
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Generalizes homomorphism indistinguishability equivalences induced by orthogonal easy quantum groups, including a classification of (0,0)-intertwiners for graph-theoretic versions.
Develops an affine calculus and higher-order quantitative logic with novel guarded recursion and induction principles over probability measures and naturals, illustrated on Markov processes and learning algorithms.
citing papers explorer
-
The Finite Length Property of the Rado Graph and Friends
Generalizes the finite length property to structures with few-orbit finite approximations (char 0) and to Fraïssé limits with free amalgamation in unary/binary vocabularies, including the Rado graph.
-
Homomorphism Indistinguishability Relations induced by Quantum Groups
Generalizes homomorphism indistinguishability equivalences induced by orthogonal easy quantum groups, including a classification of (0,0)-intertwiners for graph-theoretic versions.
-
Induction and Recursion Principles in a Higher-Order Quantitative Logic for Probability
Develops an affine calculus and higher-order quantitative logic with novel guarded recursion and induction principles over probability measures and naturals, illustrated on Markov processes and learning algorithms.