The paper shows that a derivation graph satisfies the global trace condition if and only if its image under a suitable adjoint is a recursive coalgebra, yielding soundness under an assumption on the semantic algebra.
Steps and traces
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A coalgebraic generalization of the belief construction is obtained via monad lifting to slices and belief decomposition, proving semantic coincidence with belief coalgebras and identifying conditions for agreement with fully observable counterparts.
citing papers explorer
-
Coalgebraic Non-Wellfounded Proofs: Recursiveness and GTC
The paper shows that a derivation graph satisfies the global trace condition if and only if its image under a suitable adjoint is a recursive coalgebra, yielding soundness under an assumption on the semantic algebra.
-
From Coalgebraic Determinization to Belief Construction for Partial Observability
A coalgebraic generalization of the belief construction is obtained via monad lifting to slices and belief decomposition, proving semantic coincidence with belief coalgebras and identifying conditions for agreement with fully observable counterparts.