Structures with oligomorphic approximation have finite length over char-0 fields, and free-amalgamation Fraïssé limits (unary/binary, optionally generically ordered) have it over any field; the Rado graph follows both ways.
The pebble-relation comonad in finite model theory
4 Pith papers cite this work, alongside 6 external citations. Polarity classification is still indexing.
4
Pith papers citing it
6
external citations · external index
representative 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.
Integer hybrid path-sums plus a sound Hoare logic enable semi-automated functional verification and expected-cost analysis of hybrid quantum programs with unbounded while loops.
citing papers explorer
-
The Finite Length Property of the Rado Graph and Friends
Structures with oligomorphic approximation have finite length over char-0 fields, and free-amalgamation Fraïssé limits (unary/binary, optionally generically ordered) have it over any field; the Rado graph follows both ways.
-
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.
-
An Effective Quantum Hoare Logic for Hybrid Quantum Programs with Unbounded Loops
Integer hybrid path-sums plus a sound Hoare logic enable semi-automated functional verification and expected-cost analysis of hybrid quantum programs with unbounded while loops.