Post #2669079
2026-04-08 13:13 UTC
A a coalgebra is called recursive, if for every F-algebra a, the equation h = c; Fh; a admits a unique solution, i.e. can act as a definition. Our contribution is a novel sufficient criterion for all coalgebras for some functor to be recursive. 3/8
Replies (1)
-
@cxandru@types.pl 2026-04-08 13:14
The key idea is that, for a d&c algorithm to terminate, the divide step should make inputs "smaller". As such, we work in the setting ๐^I for some well ordered set (I, <). We introduce the novel concept of a well founded (endo)-functor on ๐^I, describing a functor whose output is pointwise determined by smaller inputs. 4/8