A coalgebraic higher-order modal fixed-point logic
arXiv:2607.19160
Abstract
We introduce a coalgebraic extension of the higher-order modal fixed-point logic (HFL) which subsumes both HFL and its probabilistic extension. We show that the emptiness problem for non-deterministic finite automata as well as the value-1 problem for probabilistic automata reduce to model-checking problems for this coalgebraic formulation of HFL.
17 pages