Showing cs.LOShow all
2 papers · 1 filter
cs.LO2026
Well-Founded Coalgebras Meet König's Lemma
Henning Urbat, Thorsten WiÃmann
König's lemma is a fundamental result about trees with countless applications in mathematics and computer science. In contrapositive form, it states that if a tree is finitely bra…
cs.LO2026
Trees in Coalgebra from Generalized Reachability
Thorsten WiÃmann, Bálint Kocsis, Jurriaan Rot +1
An automaton is called reachable if every state is reachable from the initial state. This notion has been generalized coalgebraically in two ways: first, via a universal property o…