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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.